Migdal et al, Equation (51)

Percentage Accurate: 99.5% → 99.5%

Time: 10.8s

Alternatives: 6

Speedup: 1.1×

• Could not converge on a ground truth

  1. k = 4.585727576325419e+189
  2. n = -9.776218455680318e+206

Specification

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \end{array} \]

FPCore

(FPCore (k n)
 :precision binary64
 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 (PI)) n) (/ (- 1.0 k) 2.0))))

Initial Program: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \end{array} \]

FPCore

(FPCore (k n)
 :precision binary64
 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 (PI)) n) (/ (- 1.0 k) 2.0))))

Alternative 1: 99.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \frac{{\left(\mathsf{PI}\left(\right) \cdot \left(n \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}} \end{array} \]

FPCore

(FPCore (k n)
 :precision binary64
 (/ (pow (* (PI) (* n 2.0)) (fma -0.5 k 0.5)) (sqrt k)))

Derivation

1. Initial program 98.9%

   \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
2. Add Preprocessing

3. Taylor expanded in k around inf

   \[\leadsto \frac{1}{\sqrt{k}} \cdot \color{blue}{e^{\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)}} \]
4. Step-by-step derivation

   1. sinh-+-cosh-rev N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \color{blue}{\left(\cosh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right) + \sinh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \color{blue}{\left(\sinh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right) + \cosh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right)\right)} \]

   3. distribute-rgt-out-- N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \left(\sinh \left(\frac{1}{2} \cdot \color{blue}{\left(1 \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) - k \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right)\right)}\right) + \cosh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right)\right) \]

   4. fp-cancel-sub-sign N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \left(\sinh \left(\frac{1}{2} \cdot \color{blue}{\left(1 \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) + \left(\mathsf{neg}\left(k\right)\right) \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right)\right)}\right) + \cosh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right)\right) \]

   5. mul-1-neg N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \left(\sinh \left(\frac{1}{2} \cdot \left(1 \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) + \color{blue}{\left(-1 \cdot k\right)} \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right)\right)\right) + \cosh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right)\right) \]

   6. distribute-rgt-in N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \left(\sinh \left(\frac{1}{2} \cdot \color{blue}{\left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 + -1 \cdot k\right)\right)}\right) + \cosh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)\right)\right) \]

   7. distribute-rgt-out-- N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \left(\sinh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 + -1 \cdot k\right)\right)\right) + \cosh \left(\frac{1}{2} \cdot \color{blue}{\left(1 \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) - k \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right)\right)}\right)\right) \]

   8. fp-cancel-sub-sign N/A

      \[\leadsto \frac{1}{\sqrt{k}} \cdot \left(\sinh \left(\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 + -1 \cdot k\right)\right)\right) + \cosh \left(\frac{1}{2} \cdot \color{blue}{\left(1 \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) + \left(\mathsf{neg}\left(k\right)\right) \cdot \log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right)\right)}\right)\right) \]

5. Applied rewrites 98.9%

   \[\leadsto \frac{1}{\sqrt{k}} \cdot \color{blue}{{\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}} \]
6. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(\frac{-1}{2}, k, \frac{1}{2}\right)\right)}} \]

   2. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{1}{\sqrt{k}}} \cdot {\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(\frac{-1}{2}, k, \frac{1}{2}\right)\right)} \]

   3. associate-*l/ N/A

      \[\leadsto \color{blue}{\frac{1 \cdot {\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(\frac{-1}{2}, k, \frac{1}{2}\right)\right)}}{\sqrt{k}}} \]

   4. *-lft-identity N/A

      \[\leadsto \frac{\color{blue}{{\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(\frac{-1}{2}, k, \frac{1}{2}\right)\right)}}}{\sqrt{k}} \]

   5. lower-/.f64 99.0

      \[\leadsto \color{blue}{\frac{{\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}}} \]

7. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\frac{{\left(\mathsf{PI}\left(\right) \cdot \left(n \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}}} \]
8. Add Preprocessing

Alternative 2: 72.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\left(\sqrt{k}\right)}^{-1} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\ \;\;\;\;\frac{{\left(\mathsf{PI}\left(\right) \cdot \left(\mathsf{PI}\left(\right) \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \sqrt{n}\\ \end{array} \end{array} \]

FPCore

(FPCore (k n)
 :precision binary64
 (if (<=
      (* (pow (sqrt k) -1.0) (pow (* (* 2.0 (PI)) n) (/ (- 1.0 k) 2.0)))
      0.0)
   (/ (pow (* (PI) (* (PI) 2.0)) (fma -0.5 k 0.5)) (sqrt k))
   (* (sqrt (* (/ 2.0 k) (PI))) (sqrt n))))

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) < 0.0

   1. Initial program 100.0%

      \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in k around inf

      \[\leadsto \color{blue}{\sqrt{\frac{1}{k}} \cdot e^{\frac{1}{2} \cdot \left(\log \left(2 \cdot \left(n \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \left(1 - k\right)\right)}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{\left(\left(2 \cdot n\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)} \cdot \sqrt{\frac{1}{k}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\left(\mathsf{PI}\left(\right) \cdot \left(\mathsf{PI}\left(\right) \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}}} \]

   if 0.0 < (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64))))

   1. Initial program 98.6%

      \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in k around 0

      \[\leadsto \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \cdot \sqrt{2}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      5. lower-/.f64 N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      6. *-commutative N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

      8. lower-PI.f64 49.2

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]

   5. Applied rewrites 49.2%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 49.3%

      \[\leadsto \color{blue}{\sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k} \cdot 2}} \]
   8. Step-by-step derivation

   9. Applied rewrites 49.4%

      \[\leadsto \sqrt{\left(n \cdot \frac{\mathsf{PI}\left(\right)}{k}\right) \cdot 2} \]
   10. Step-by-step derivation

   11. Applied rewrites 69.3%

       \[\leadsto \sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \color{blue}{\sqrt{n}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 76.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(\sqrt{k}\right)}^{-1} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\ \;\;\;\;\frac{{\left(\mathsf{PI}\left(\right) \cdot \left(\mathsf{PI}\left(\right) \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \sqrt{n}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 50.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{PI}\left(\right) \cdot n\\ \mathbf{if}\;k \leq 1.6 \cdot 10^{+174}:\\ \;\;\;\;\sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \sqrt{n}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{\mathsf{fma}\left(t\_0, k, k \cdot t\_0\right)}{k \cdot k}}\\ \end{array} \end{array} \]

FPCore

(FPCore (k n)
 :precision binary64
 (let* ((t_0 (* (PI) n)))
   (if (<= k 1.6e+174)
     (* (sqrt (* (/ 2.0 k) (PI))) (sqrt n))
     (sqrt (/ (fma t_0 k (* k t_0)) (* k k))))))

Derivation

1. Split input into 2 regimes

2. if k < 1.6e174

   1. Initial program 98.7%

      \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in k around 0

      \[\leadsto \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \cdot \sqrt{2}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      5. lower-/.f64 N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      6. *-commutative N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

      8. lower-PI.f64 47.5

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]

   5. Applied rewrites 47.5%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 47.7%

      \[\leadsto \color{blue}{\sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k} \cdot 2}} \]
   8. Step-by-step derivation

   9. Applied rewrites 47.7%

      \[\leadsto \sqrt{\left(n \cdot \frac{\mathsf{PI}\left(\right)}{k}\right) \cdot 2} \]
   10. Step-by-step derivation

   11. Applied rewrites 66.8%

       \[\leadsto \sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \color{blue}{\sqrt{n}} \]

   if 1.6e174 < k

   1. Initial program 100.0%

      \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in k around 0

      \[\leadsto \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \cdot \sqrt{2}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      5. lower-/.f64 N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

      6. *-commutative N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

      7. lower-*.f64 N/A

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

      8. lower-PI.f64 2.5

         \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]

   5. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k} \cdot 2}} \]
   8. Step-by-step derivation

   9. Applied rewrites 13.4%

      \[\leadsto \sqrt{\frac{\mathsf{fma}\left(\mathsf{PI}\left(\right) \cdot n, k, k \cdot \left(\mathsf{PI}\left(\right) \cdot n\right)\right)}{k \cdot k}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 48.8% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \sqrt{n} \end{array} \]

FPCore

(FPCore (k n) :precision binary64 (* (sqrt (* (/ 2.0 k) (PI))) (sqrt n)))

Derivation

1. Initial program 98.9%

   \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
2. Add Preprocessing

3. Taylor expanded in k around 0

   \[\leadsto \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \cdot \sqrt{2}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   3. lower-sqrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]

   4. lower-sqrt.f64 N/A

      \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   5. lower-/.f64 N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   6. *-commutative N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

   7. lower-*.f64 N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

   8. lower-PI.f64 39.1

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]

5. Applied rewrites 39.1%

   \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k}}} \]
6. Step-by-step derivation

7. Applied rewrites 39.2%

   \[\leadsto \color{blue}{\sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k} \cdot 2}} \]
8. Step-by-step derivation

9. Applied rewrites 39.2%

   \[\leadsto \sqrt{\left(n \cdot \frac{\mathsf{PI}\left(\right)}{k}\right) \cdot 2} \]
10. Step-by-step derivation

11. Applied rewrites 54.8%

    \[\leadsto \sqrt{\frac{2}{k} \cdot \mathsf{PI}\left(\right)} \cdot \color{blue}{\sqrt{n}} \]
12. Add Preprocessing

Alternative 5: 48.8% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \sqrt{\mathsf{PI}\left(\right) \cdot n} \cdot \sqrt{\frac{2}{k}} \end{array} \]

FPCore

(FPCore (k n) :precision binary64 (* (sqrt (* (PI) n)) (sqrt (/ 2.0 k))))

Derivation

1. Initial program 98.9%

   \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
2. Add Preprocessing

3. Taylor expanded in k around 0

   \[\leadsto \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \cdot \sqrt{2}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   3. lower-sqrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]

   4. lower-sqrt.f64 N/A

      \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   5. lower-/.f64 N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   6. *-commutative N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

   7. lower-*.f64 N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

   8. lower-PI.f64 39.1

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]

5. Applied rewrites 39.1%

   \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k}}} \]
6. Step-by-step derivation

7. Applied rewrites 39.2%

   \[\leadsto \color{blue}{\sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k} \cdot 2}} \]
8. Step-by-step derivation

9. Applied rewrites 54.5%

   \[\leadsto \sqrt{\mathsf{PI}\left(\right) \cdot n} \cdot \color{blue}{\sqrt{\frac{2}{k}}} \]
10. Add Preprocessing

Alternative 6: 37.6% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \sqrt{\left(n \cdot \frac{\mathsf{PI}\left(\right)}{k}\right) \cdot 2} \end{array} \]

FPCore

(FPCore (k n) :precision binary64 (sqrt (* (* n (/ (PI) k)) 2.0)))

Derivation

1. Initial program 98.9%

   \[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
2. Add Preprocessing

3. Taylor expanded in k around 0

   \[\leadsto \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \cdot \sqrt{2}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   3. lower-sqrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]

   4. lower-sqrt.f64 N/A

      \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   5. lower-/.f64 N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]

   6. *-commutative N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

   7. lower-*.f64 N/A

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]

   8. lower-PI.f64 39.1

      \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]

5. Applied rewrites 39.1%

   \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k}}} \]
6. Step-by-step derivation

7. Applied rewrites 39.2%

   \[\leadsto \color{blue}{\sqrt{\frac{\mathsf{PI}\left(\right) \cdot n}{k} \cdot 2}} \]
8. Step-by-step derivation

9. Applied rewrites 39.2%

   \[\leadsto \sqrt{\left(n \cdot \frac{\mathsf{PI}\left(\right)}{k}\right) \cdot 2} \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024354 
(FPCore (k n)
  :name "Migdal et al, Equation (51)"
  :precision binary64
  (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 (PI)) n) (/ (- 1.0 k) 2.0))))