Average Error: 0.0 → 0.0
Time: 4.4s
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[\left(a + b\right) \cdot \left(a - b\right)\]
a \cdot a - b \cdot b
↓
\left(a + b\right) \cdot \left(a - b\right)
double f(double a, double b) {
        double r1328017 = a;
        double r1328018 = r1328017 * r1328017;
        double r1328019 = b;
        double r1328020 = r1328019 * r1328019;
        double r1328021 = r1328018 - r1328020;
        return r1328021;
}
↓
double f(double a, double b) {
        double r1328022 = a;
        double r1328023 = b;
        double r1328024 = r1328022 + r1328023;
        double r1328025 = r1328022 - r1328023;
        double r1328026 = r1328024 * r1328025;
        return r1328026;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(a + b\right) \cdot \left(a - b\right)\]

Derivation

  1. Initial program 0.0

    \[a \cdot a - b \cdot b\]

  2. Taylor expanded around -inf 0.0

    \[\leadsto \color{blue}{{a}^{2} - {b}^{2}}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{\left(b + a\right) \cdot \left(a - b\right)}\]

  4. Final simplification0.0

    \[\leadsto \left(a + b\right) \cdot \left(a - b\right)\]

Reproduce

herbie shell --seed 2019152 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"

  :herbie-target
  (* (+ a b) (- a b))

  (- (* a a) (* b b)))