Migdal et al, Equation (51)

Percentage Accurate: 99.5% → 99.5%

Time: 6.4s

Alternatives: 5

Speedup: 1.1×

• Could not converge on a ground truth

  1. k = 1.592709776051724e+290
  2. n = -1.353260279081941e+132

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(\mathsf{PI}\left(\right) \cdot 2\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 (* (* (PI) 2.0) n) (fma -0.5 k 0.5)) (sqrt k)))

Derivation

1. Initial program 99.5%

   \[\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.5%

   \[\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.5%

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

9. Applied rewrites 99.6%

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

10. Final simplification 99.6%

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

Alternative 2: 62.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\mathsf{PI}\left(\right) \cdot 2\right) \cdot n\\ \mathbf{if}\;{t\_0}^{\left(\frac{1 - k}{2}\right)} \cdot \frac{1}{\sqrt{k}} \leq 2 \cdot 10^{-69}:\\ \;\;\;\;\sqrt{t\_0} \cdot {\left(k \cdot k\right)}^{-0.25}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right)}{k}}\\ \end{array} \end{array} \]

FPCore

(FPCore (k n)
 :precision binary64
 (let* ((t_0 (* (* (PI) 2.0) n)))
   (if (<= (* (pow t_0 (/ (- 1.0 k) 2.0)) (/ 1.0 (sqrt k))) 2e-69)
     (* (sqrt t_0) (pow (* k k) -0.25))
     (* (sqrt (* n 2.0)) (sqrt (/ (PI) k))))))

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)))) < 1.9999999999999999e-69

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

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

   5. Applied rewrites 18.0%

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

   7. Applied rewrites 17.9%

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

   9. Applied rewrites 51.8%

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

   if 1.9999999999999999e-69 < (*.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 99.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 45.8

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

   5. Applied rewrites 45.8%

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

   7. Applied rewrites 45.9%

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

   9. Applied rewrites 45.9%

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

   11. Applied rewrites 63.3%

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

4. Final simplification 60.0%

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

Alternative 3: 98.1% accurate, 1.1× speedup

Math

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

Derivation

1. Split input into 2 regimes

2. if k < 1

   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 71.9

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

   5. Applied rewrites 71.9%

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

   7. Applied rewrites 72.0%

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

   9. Applied rewrites 72.0%

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

   11. Applied rewrites 96.3%

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

   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 100.0

         \[\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 100.0%

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

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 100.0

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

   7. Applied rewrites 100.0%

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

4. Final simplification 98.1%

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

Alternative 4: 49.3% 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.5%

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

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

5. Applied rewrites 37.8%

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

7. Applied rewrites 37.8%

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

9. Applied rewrites 37.8%

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

11. Applied rewrites 50.2%

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

12. Final simplification 50.2%

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

Alternative 5: 38.1% 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.5%

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

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

5. Applied rewrites 37.8%

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

7. Applied rewrites 37.8%

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

9. Applied rewrites 37.8%

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

10. Final simplification 37.8%

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

Reproduce

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