Migdal et al, Equation (51)

Percentage Accurate: 99.4% → 99.4%
Time: 9.2s
Alternatives: 6
Speedup: 1.1×

Specification

?
\[\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 (k n)
 :precision binary64
 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 (PI)) n) (/ (- 1.0 k) 2.0))))
\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}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.4% accurate, 1.0× speedup?

\[\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 (k n)
 :precision binary64
 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 (PI)) n) (/ (- 1.0 k) 2.0))))
\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}

Alternative 1: 99.4% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \sqrt{\frac{1}{k}} \cdot {\left(\left(n \cdot 2\right) \cdot \mathsf{PI}\left(\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)} \end{array} \]
(FPCore (k n)
 :precision binary64
 (* (sqrt (/ 1.0 k)) (pow (* (* n 2.0) (PI)) (fma k -0.5 0.5))))
\begin{array}{l}

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

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

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

Alternative 2: 98.1% accurate, 1.1× speedup?

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

\\
\begin{array}{l}
\mathbf{if}\;k \leq 1:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right)}{k}}\\

\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}
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. *-commutativeN/A

        \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
      2. lower-*.f64N/A

        \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
      3. lower-sqrt.f64N/A

        \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
      5. lower-/.f64N/A

        \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
      6. *-commutativeN/A

        \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
      7. lower-*.f64N/A

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

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

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

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

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

        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. *-commutativeN/A

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

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

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

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

            \[\leadsto \color{blue}{{\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(k \cdot \frac{-1}{2}\right)} \cdot \frac{1}{\sqrt{k}}} \]
          3. lift-/.f64N/A

            \[\leadsto {\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(k \cdot \frac{-1}{2}\right)} \cdot \color{blue}{\frac{1}{\sqrt{k}}} \]
          4. un-div-invN/A

            \[\leadsto \color{blue}{\frac{{\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(k \cdot \frac{-1}{2}\right)}}{\sqrt{k}}} \]
          5. lower-/.f6499.3

            \[\leadsto \color{blue}{\frac{{\left(\left(2 \cdot \mathsf{PI}\left(\right)\right) \cdot n\right)}^{\left(k \cdot -0.5\right)}}{\sqrt{k}}} \]
          6. lift-*.f64N/A

            \[\leadsto \frac{{\left(\color{blue}{\left(2 \cdot \mathsf{PI}\left(\right)\right)} \cdot n\right)}^{\left(k \cdot \frac{-1}{2}\right)}}{\sqrt{k}} \]
          7. *-commutativeN/A

            \[\leadsto \frac{{\left(\color{blue}{\left(\mathsf{PI}\left(\right) \cdot 2\right)} \cdot n\right)}^{\left(k \cdot \frac{-1}{2}\right)}}{\sqrt{k}} \]
          8. lift-*.f6499.3

            \[\leadsto \frac{{\left(\color{blue}{\left(\mathsf{PI}\left(\right) \cdot 2\right)} \cdot n\right)}^{\left(k \cdot -0.5\right)}}{\sqrt{k}} \]
        7. Applied rewrites99.3%

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

        \[\leadsto \begin{array}{l} \mathbf{if}\;k \leq 1:\\ \;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right)}{k}}\\ \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 3: 99.4% accurate, 1.1× speedup?

      \[\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 (k n)
       :precision binary64
       (/ (pow (* (* (PI) 2.0) n) (fma -0.5 k 0.5)) (sqrt k)))
      \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}
      
      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 n around -inf

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

          \[\leadsto \frac{1}{\sqrt{k}} \cdot e^{\color{blue}{\left(\left(\log \left(-2 \cdot \mathsf{PI}\left(\right)\right) + -1 \cdot \log \left(\frac{-1}{n}\right)\right) \cdot \left(1 - k\right)\right) \cdot \frac{1}{2}}} \]
        2. associate-*l*N/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot e^{\color{blue}{\left(\log \left(-2 \cdot \mathsf{PI}\left(\right)\right) + -1 \cdot \log \left(\frac{-1}{n}\right)\right) \cdot \left(\left(1 - k\right) \cdot \frac{1}{2}\right)}} \]
        3. exp-prodN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot \color{blue}{{\left(e^{\log \left(-2 \cdot \mathsf{PI}\left(\right)\right) + -1 \cdot \log \left(\frac{-1}{n}\right)}\right)}^{\left(\left(1 - k\right) \cdot \frac{1}{2}\right)}} \]
        4. *-commutativeN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(e^{\log \left(-2 \cdot \mathsf{PI}\left(\right)\right) + -1 \cdot \log \left(\frac{-1}{n}\right)}\right)}^{\color{blue}{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)}} \]
        5. lower-pow.f64N/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot \color{blue}{{\left(e^{\log \left(-2 \cdot \mathsf{PI}\left(\right)\right) + -1 \cdot \log \left(\frac{-1}{n}\right)}\right)}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)}} \]
        6. mul-1-negN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(e^{\log \left(-2 \cdot \mathsf{PI}\left(\right)\right) + \color{blue}{\left(\mathsf{neg}\left(\log \left(\frac{-1}{n}\right)\right)\right)}}\right)}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)} \]
        7. unsub-negN/A

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

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

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\color{blue}{\left(\frac{e^{\log \left(-2 \cdot \mathsf{PI}\left(\right)\right)}}{e^{\log \left(\frac{-1}{n}\right)}}\right)}}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)} \]
        10. rem-exp-logN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(\frac{\color{blue}{-2 \cdot \mathsf{PI}\left(\right)}}{e^{\log \left(\frac{-1}{n}\right)}}\right)}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)} \]
        11. lower-*.f64N/A

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

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(\frac{-2 \cdot \color{blue}{\mathsf{PI}\left(\right)}}{e^{\log \left(\frac{-1}{n}\right)}}\right)}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)} \]
        13. rem-exp-logN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(\frac{-2 \cdot \mathsf{PI}\left(\right)}{\color{blue}{\frac{-1}{n}}}\right)}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)} \]
        14. lower-/.f64N/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(\frac{-2 \cdot \mathsf{PI}\left(\right)}{\color{blue}{\frac{-1}{n}}}\right)}^{\left(\frac{1}{2} \cdot \left(1 - k\right)\right)} \]
        15. sub-negN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(\frac{-2 \cdot \mathsf{PI}\left(\right)}{\frac{-1}{n}}\right)}^{\left(\frac{1}{2} \cdot \color{blue}{\left(1 + \left(\mathsf{neg}\left(k\right)\right)\right)}\right)} \]
        16. mul-1-negN/A

          \[\leadsto \frac{1}{\sqrt{k}} \cdot {\left(\frac{-2 \cdot \mathsf{PI}\left(\right)}{\frac{-1}{n}}\right)}^{\left(\frac{1}{2} \cdot \left(1 + \color{blue}{-1 \cdot k}\right)\right)} \]
      5. Applied rewrites99.4%

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

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

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

          \[\leadsto {\left(\frac{-2 \cdot \mathsf{PI}\left(\right)}{\frac{-1}{n}}\right)}^{\left(\mathsf{fma}\left(k, \frac{-1}{2}, \frac{1}{2}\right)\right)} \cdot \color{blue}{\frac{1}{\sqrt{k}}} \]
        4. un-div-invN/A

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

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

        \[\leadsto \color{blue}{\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}}} \]
      8. Add Preprocessing

      Alternative 4: 49.5% accurate, 3.6× speedup?

      \[\begin{array}{l} \\ \sqrt{n \cdot 2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right)}{k}} \end{array} \]
      (FPCore (k n) :precision binary64 (* (sqrt (* n 2.0)) (sqrt (/ (PI) k))))
      \begin{array}{l}
      
      \\
      \sqrt{n \cdot 2} \cdot \sqrt{\frac{\mathsf{PI}\left(\right)}{k}}
      \end{array}
      
      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. *-commutativeN/A

          \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
        2. lower-*.f64N/A

          \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
        3. lower-sqrt.f64N/A

          \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]
        4. lower-sqrt.f64N/A

          \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
        5. lower-/.f64N/A

          \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
        6. *-commutativeN/A

          \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
        7. lower-*.f64N/A

          \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
        8. lower-PI.f6437.3

          \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]
      5. Applied rewrites37.3%

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

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

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

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

          Alternative 5: 49.5% accurate, 3.6× speedup?

          \[\begin{array}{l} \\ \sqrt{\frac{\mathsf{PI}\left(\right)}{k} \cdot 2} \cdot \sqrt{n} \end{array} \]
          (FPCore (k n) :precision binary64 (* (sqrt (* (/ (PI) k) 2.0)) (sqrt n)))
          \begin{array}{l}
          
          \\
          \sqrt{\frac{\mathsf{PI}\left(\right)}{k} \cdot 2} \cdot \sqrt{n}
          \end{array}
          
          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. *-commutativeN/A

              \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
            2. lower-*.f64N/A

              \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
            3. lower-sqrt.f64N/A

              \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]
            4. lower-sqrt.f64N/A

              \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
            5. lower-/.f64N/A

              \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
            6. *-commutativeN/A

              \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
            7. lower-*.f64N/A

              \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
            8. lower-PI.f6437.3

              \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]
          5. Applied rewrites37.3%

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

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

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

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

              Alternative 6: 38.0% accurate, 4.8× speedup?

              \[\begin{array}{l} \\ \sqrt{\frac{2}{k} \cdot \left(\mathsf{PI}\left(\right) \cdot n\right)} \end{array} \]
              (FPCore (k n) :precision binary64 (sqrt (* (/ 2.0 k) (* (PI) n))))
              \begin{array}{l}
              
              \\
              \sqrt{\frac{2}{k} \cdot \left(\mathsf{PI}\left(\right) \cdot n\right)}
              \end{array}
              
              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. *-commutativeN/A

                  \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
                2. lower-*.f64N/A

                  \[\leadsto \color{blue}{\sqrt{2} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
                3. lower-sqrt.f64N/A

                  \[\leadsto \color{blue}{\sqrt{2}} \cdot \sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}} \]
                4. lower-sqrt.f64N/A

                  \[\leadsto \sqrt{2} \cdot \color{blue}{\sqrt{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
                5. lower-/.f64N/A

                  \[\leadsto \sqrt{2} \cdot \sqrt{\color{blue}{\frac{n \cdot \mathsf{PI}\left(\right)}{k}}} \]
                6. *-commutativeN/A

                  \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
                7. lower-*.f64N/A

                  \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right) \cdot n}}{k}} \]
                8. lower-PI.f6437.3

                  \[\leadsto \sqrt{2} \cdot \sqrt{\frac{\color{blue}{\mathsf{PI}\left(\right)} \cdot n}{k}} \]
              5. Applied rewrites37.3%

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

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

                    \[\leadsto \sqrt{\left(\mathsf{PI}\left(\right) \cdot n\right) \cdot \frac{2}{k}} \]
                  2. Final simplification37.5%

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

                  Reproduce

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