Migdal et al, Equation (51)

Percentage Accurate: 99.5% → 99.5%

Time: 9.7s

Alternatives: 7

Speedup: 1.1×

• Could not converge on a ground truth

  1. k = 2.9465880042006154e+225
  2. n = -4957660816166869000.0

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(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}}{\sqrt{k}} \end{array} \]

FPCore

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

Derivation

1. Initial program 99.2%

   \[\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. Step-by-step derivation

   1. lift-pow.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift--.f64 N/A

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

   4. div-sub N/A

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

   5. metadata-eval N/A

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

   6. sub-neg N/A

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

   7. +-commutative N/A

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

   8. unpow-prod-up N/A

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

   9. lower-*.f64 N/A

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

4. Applied rewrites 98.8%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. un-div-inv N/A

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

   5. lower-/.f64 98.9

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

6. Applied rewrites 99.3%

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

Alternative 2: 98.3% accurate, 1.1× speedup

Math

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

FPCore

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

Derivation

1. Split input into 2 regimes

2. if k < 1

   1. Initial program 98.4%

      \[\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 67.8

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

   5. Applied rewrites 67.8%

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

   7. Applied rewrites 67.8%

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

   9. Applied rewrites 67.9%

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

   11. Applied rewrites 98.7%

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

   if 1 < 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 inf

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

      1. lower-*.f64 98.6

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

   5. Applied rewrites 98.6%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 98.6

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

   7. Applied rewrites 98.6%

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

Alternative 3: 49.7% accurate, 3.6× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.2%

   \[\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 33.4

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

5. Applied rewrites 33.4%

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

7. Applied rewrites 33.5%

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

9. Applied rewrites 33.5%

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

11. Applied rewrites 48.1%

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

Alternative 4: 49.6% accurate, 3.6× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.2%

   \[\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 33.4

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

5. Applied rewrites 33.4%

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

7. Applied rewrites 33.5%

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

9. Applied rewrites 47.8%

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

Alternative 5: 49.6% 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 99.2%

   \[\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 33.4

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

5. Applied rewrites 33.4%

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

7. Applied rewrites 33.5%

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

9. Applied rewrites 33.5%

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

11. Applied rewrites 47.8%

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

Alternative 6: 49.6% accurate, 3.6× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.2%

   \[\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 33.4

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

5. Applied rewrites 33.4%

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

7. Applied rewrites 33.5%

   \[\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{n \cdot \mathsf{PI}\left(\right)} \cdot \color{blue}{\sqrt{\frac{2}{k}}} \]
10. Add Preprocessing

Alternative 7: 37.5% accurate, 4.8× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.2%

   \[\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 33.4

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

5. Applied rewrites 33.4%

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

7. Applied rewrites 33.5%

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

9. Applied rewrites 33.5%

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

Reproduce

herbie shell --seed 2024305 
(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))))