How would one calculate Pi using Fixed-Point Arithmetic using the leibniz series?

Question

I am trying to use an ALU and Leibniz Series to approximate pi using only integer operations ie multiplication and shifting. Does anyone know how I could program this in C?

Depending on what the purpose of this exercise is, use of a [*spigot algorithm*](https://en.wikipedia.org/wiki/Spigot_algorithm) may be a good choice. As far as I know, the algorithms are not based on the Leibniz formula for π, however. — njuffa, Mar 07 '20 at 20:57

score 0 · Answer 1 · edited Feb 27 '20 at 14:39

0

sum = 0;

for (int i = 1; i <= 10; i++) {
  sum = sum + (-1) * (1 / (2.0 * i + 1));
}

Printf("Pi=%f",4 * (sum + 1));

edited Feb 27 '20 at 14:39

Norbert

2,741
8
56
111

answered Feb 27 '20 at 06:12

Siva Koteswara Rao

129
1
6

1

would this not be lost to integer division truncation? – Logan Dennison Feb 27 '20 at 06:16
With the promotion to `double`, I don't think that qualifies as "using only integer operations". – John McFarlane Feb 28 '20 at 18:24

How would one calculate Pi using Fixed-Point Arithmetic using the leibniz series?

1 Answers1