Average Error: 0.0 → 0.0
Time: 4.9s
Precision: binary64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
double code(double c) {
	return ((double) fmod(((double) sinh(c)), ((double) (c - ((double) pow(-2.9807307601812193e+165, 2.0))))));
}
double code(double c) {
	return ((double) fmod(((double) sinh(c)), ((double) (c - ((double) pow(-2.9807307601812193e+165, 2.0))))));
}

Error

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
  2. Final simplification0.0

    \[\leadsto \left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]

Reproduce

herbie shell --seed 2020147 
(FPCore (c)
  :name "Random Jason Timeout Test 002"
  :precision binary64
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2.0))))