Loading [MathJax]/jax/output/HTML-CSS/jax.js

Friday, September 23, 2016

Entry 11

The previous entry featured the Chudnovsky algorithm which uses the negative discriminant d=163 and has class number h(d)=1. Just like Ramanujan's well-known formula which uses d=4×58 and has h(d)=2, the algorithm is also connected to Pell equations. Let n=3×163=489. The fundamental solution to u2489v2=1 is then given by the expansion of the fundamental unit Un=(118(6403206)3+4826163)2=u+v489 Recall that eπ1636403203+743.99999999999925. Some experimentation yielded 33(U1/2nU1/2n)+18=223372112 163(U1/2n+U1/2n)=2219127163 33(U1/2nU1/2n)+6=640320 and we find these integers in the Chudnovsky algorithm 12k=0(1)k(6k)!k!3(3k)!23271119127163k+13591409(6403203)k+1/2=1π The same thing happens with the other large d with h(d)=1, for example 3×67=201 U201=(118(52806)3+6267)2 and eπ6752803+743.9999986. Similar expressions using U201 will yield the integers for its corresponding pi formula.

No comments:

Post a Comment