51–60 of 118 posts
Earlier quoted context omitted.
That’s not quite how it works.
Why not? It is. Calculating pi is trivially parallelizable. If you wrote good kernels, calculation distribution could be exactly the same.
> March 14 (represented as 3/14 in many parts of the world) haha
I wanted to comment the same part, but I wanted to let them the benefit of the doubt, so I went to Wikipedia «date format by country» page [1], and summed up from the table how many people have "MD" vs "DM" in their date format: DM -> 3392/5550 ~= 61.1% MD -> 2158/5550 ~= 38.9% Note: I ignored both green and red regions that have both "DM" and "MD" in their format. So it is definitively not the majority of people. Us…
The piano music for each digit at the A-π (API) page is particularly beautiful https://pi.delivery/#demosmusic
"The numbers and rests in the formula translate to 16th notes on the kick drum, and 16th note rests. There is no kick drum beats where there are snare drums.
With the decimal point BEFORE the number, and starting with the first number, move that many decimal points to the right and insert that many 16th note rests. Use one 16th note rest to divide the numbers you passed (when applicable). Continue on throughout the rest of the figure. No repeats."
The details of the video have the full explanation
Earlier quoted context omitted.
> The same way there's no 'need' to find bigger prime numbers. From cryptography standpoint, there is always a need to find bigger prime number. I wouldn't compare this with a Pi.
Finding a change in the behavior of Pi that emerges at high precisions would be a significant discovery.
Earlier quoted context omitted.
This is explained in the second paragraph: > Yee independently verified the calculation using Bellard's formula[0] and BBP formula[1] [0] https://en.wikipedia.org/wiki/Bellard%27s_formula [1] https://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%9...
Disappointed the Wikipedia article didn’t explain how in the world they arrived at that formula, why it even works. This type of stuff is pure magic to me.
Earlier quoted context omitted.
This is explained in the second paragraph: > Yee independently verified the calculation using Bellard's formula[0] and BBP formula[1] [0] https://en.wikipedia.org/wiki/Bellard%27s_formula [1] https://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%9...
Disappointed the Wikipedia article didn’t explain how in the world they arrived at that formula, why it even works. This type of stuff is pure magic to me.
Earlier quoted context omitted.
> The same way there's no 'need' to find bigger prime numbers. From cryptography standpoint, there is always a need to find bigger prime number. I wouldn't compare this with a Pi.
Finding a change in the behavior of Pi that emerges at high precisions would be a significant discovery.
Does pi compress? It must if it is only numbers, but only by a half?
However, there are compact formulas which can generate pi to arbitrary precision, trading off compute time with space. So it;'s effectively compressible, I guess this relates to Kolomogorov complexity in some way.
> March 14 (represented as 3/14 in many parts of the world) haha