Migdal et al, Equation (51)

Percentage Accurate: 99.4% → 99.5%

Time: 9.3s

Alternatives: 9

Speedup: 1.1×

• Could not converge on a ground truth

  1. k = 2.3605691921361586e+302
  2. n = -4.0536613040719085e+208

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

FPCore

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

Derivation

1. Initial program 99.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 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)}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \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)} \cdot \sqrt{\frac{1}{k}}} \]

   2. lower-*.f64 N/A

      \[\leadsto \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)} \cdot \sqrt{\frac{1}{k}}} \]

5. Applied rewrites 99.7%

   \[\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. Final simplification 99.7%

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

Alternative 2: 98.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;k \leq 1:\\ \;\;\;\;\frac{\sqrt{n \cdot 2}}{\sqrt{\frac{k}{\mathsf{PI}\left(\right)}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(\left(\mathsf{PI}\left(\right) \cdot n\right) \cdot 2\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 2.0)) (sqrt (/ k (PI))))
   (/ (pow (* (* (PI) n) 2.0) (* -0.5 k)) (sqrt k))))

Derivation

1. Split input into 2 regimes

2. if k < 1

   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 78.3

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

   5. Applied rewrites 78.3%

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

   7. Applied rewrites 78.4%

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

   9. Applied rewrites 99.2%

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

   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 \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)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \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)} \cdot \sqrt{\frac{1}{k}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \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)} \cdot \sqrt{\frac{1}{k}}} \]

   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}}} \]

   7. Applied rewrites 100.0%

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

   9. Applied rewrites 100.0%

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

   10. Taylor expanded in k around inf

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

   12. Applied rewrites 100.0%

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

4. Final simplification 99.6%

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

Alternative 3: 99.5% accurate, 1.1× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.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 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)}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \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)} \cdot \sqrt{\frac{1}{k}}} \]

   2. lower-*.f64 N/A

      \[\leadsto \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)} \cdot \sqrt{\frac{1}{k}}} \]

5. Applied rewrites 99.7%

   \[\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}}} \]

7. Applied rewrites 99.6%

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

9. Applied rewrites 99.6%

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

11. Applied rewrites 99.6%

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

Alternative 4: 48.7% accurate, 3.2× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.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 42.4

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

5. Applied rewrites 42.4%

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

7. Applied rewrites 42.5%

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

9. Applied rewrites 53.5%

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

10. Final simplification 53.5%

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

Alternative 5: 48.7% 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 99.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 42.4

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

5. Applied rewrites 42.4%

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

7. Applied rewrites 42.5%

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

9. Applied rewrites 53.5%

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

10. Final simplification 53.5%

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

Alternative 6: 48.7% accurate, 3.6× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.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 42.4

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

5. Applied rewrites 42.4%

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

7. Applied rewrites 42.5%

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

9. Applied rewrites 53.2%

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

10. Final simplification 53.2%

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

Alternative 7: 37.8% accurate, 4.8× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.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 42.4

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

5. Applied rewrites 42.4%

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

7. Applied rewrites 42.5%

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

9. Applied rewrites 42.5%

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

Alternative 8: 37.8% accurate, 4.8× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.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 42.4

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

5. Applied rewrites 42.4%

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

7. Applied rewrites 42.5%

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

9. Applied rewrites 42.5%

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

11. Applied rewrites 42.5%

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

Alternative 9: 37.8% accurate, 4.8× speedup

Math

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

FPCore

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

Derivation

1. Initial program 99.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 42.4

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

5. Applied rewrites 42.4%

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

7. Applied rewrites 42.5%

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

9. Applied rewrites 42.5%

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

10. Final simplification 42.5%

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

Reproduce

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