Average Error: 30.6 → 0.1
Time: 2.7s
Precision: binary64
\[\sqrt{x \cdot x + x \cdot x} \]
\[\mathsf{hypot}\left(x, x\right) \]
(FPCore (x) :precision binary64 (sqrt (+ (* x x) (* x x))))
(FPCore (x) :precision binary64 (hypot x x))
double code(double x) {
	return sqrt(((x * x) + (x * x)));
}
double code(double x) {
	return hypot(x, x);
}
public static double code(double x) {
	return Math.sqrt(((x * x) + (x * x)));
}
public static double code(double x) {
	return Math.hypot(x, x);
}
def code(x):
	return math.sqrt(((x * x) + (x * x)))
def code(x):
	return math.hypot(x, x)
function code(x)
	return sqrt(Float64(Float64(x * x) + Float64(x * x)))
end
function code(x)
	return hypot(x, x)
end
function tmp = code(x)
	tmp = sqrt(((x * x) + (x * x)));
end
function tmp = code(x)
	tmp = hypot(x, x);
end
code[x_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
code[x_] := N[Sqrt[x ^ 2 + x ^ 2], $MachinePrecision]
\sqrt{x \cdot x + x \cdot x}
\mathsf{hypot}\left(x, x\right)

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 30.6

    \[\sqrt{x \cdot x + x \cdot x} \]
  2. Simplified0.1

    \[\leadsto \color{blue}{\mathsf{hypot}\left(x, x\right)} \]
  3. Final simplification0.1

    \[\leadsto \mathsf{hypot}\left(x, x\right) \]

Reproduce

herbie shell --seed 2022134 
(FPCore (x)
  :name "sqrt A"
  :precision binary64
  (sqrt (+ (* x x) (* x x))))