Almkvist-Giullera formula for pi: Difference between revisions
m
→{{header|Haskell}}: Fix names.
m (→{{header|Common Lisp}}: Fix names.) |
m (→{{header|Haskell}}: Fix names.) |
||
Line 595:
powInteger b e = b `timesInteger` powInteger b (e `minusInteger` 1)
-- The
almkvistGiulleraIntegral n =
let polynomial = (532 `timesInteger` n `timesInteger` n) `plusInteger` (126 `timesInteger` n) `plusInteger` 9
numerator = 32 `timesInteger` (facInteger (6 `timesInteger` n)) `timesInteger` polynomial
Line 608:
-- The Nth term in the series
-- The sum of the first N terms
-- The approximation of pi from the first N terms
Line 624:
main = do
(printf "N. %44s %4s %s\n" "Integral part of Nth term" "×10^" "=Actual value of Nth term")
mapM_ (\n -> printf "%d. %44d %4d %s\n" n (
printf "\nPi after %d iterations:\n" iterations
putStrLn $ showCReal 70 $
</lang>
{{Out}}
| |||