Discussion Overview
The discussion revolves around the calculation of mathematical constants to high precision, specifically targeting the computation of constants like ln(2) to tens or hundreds of millions of decimal places. Participants explore various software options and programming approaches to achieve this goal efficiently.
Discussion Character
- Exploratory
- Technical explanation
- Debate/contested
Main Points Raised
- One participant is using PARI/GP for high-precision calculations but finds it inefficient for computing ln(2) at the desired precision.
- Another participant claims to have an efficient program that can compute 100 million digits in about an hour on a 3GHz computer and offers to share it.
- There is a request for the program from another participant who has been searching for a similar solution.
- After receiving the program, one participant reports discrepancies between the computed value of ln(2) and a trusted value, noting that they match for the first million digits but diverge thereafter.
- This participant expresses confusion over the nature of the error, particularly regarding the repetition and roundness of the numbers in the results.
- Another participant suggests that the discrepancies might be due to the method used for computation and recommends trying different algorithms such as Machin, Borwein, or Ramanujan.
- There is speculation that the issue might lie in postprocessing rather than the calculation itself.
Areas of Agreement / Disagreement
Participants express differing views on the reliability of the program shared and the accuracy of the results obtained. There is no consensus on the source of the discrepancies observed in the calculations.
Contextual Notes
Participants mention various computational methods and algorithms, but there is uncertainty regarding their effectiveness in this context. The discussion includes references to specific values and sequences, which may depend on definitions and assumptions not fully explored.