[math-fun] FW: A conjectural series for 1/pi of a new type
I'll guess that some here would dispute that this series qualifies as "converges rapidly", but it seems worth passing along the challenge (to prove the conjecture.) Rich -----Original Message----- From: Number Theory List [mailto:NMBRTHRY@LISTSERV.NODAK.EDU] On Behalf Of Zhi-Wei SUN Sent: Thursday, January 13, 2011 8:35 AM To: NMBRTHRY@LISTSERV.NODAK.EDU Subject: A conjectural series for 1/pi of a new type Dear number theorists, On Jan. 2, 2011 I found a new type series for 1/pi. CONJECTURE (Zhi-Wei Sun). We have Sum_{k=0,1,2,...}(30k+7)binom(2k,k)^2*a_k/(-256)^k = 24/pi, where a_k=T_k(1,16) is the coefficient of x^k in (x^2+x+16)^k. I have included this conjecture in an article of mine (to be expanded later) available from http://arxiv.org/abs/1101.0600 Since a_k=T_k(1,16) ~ 0.75*9^k/sqrt(k*pi) as k tends to the infinity, we have binom(2k,k)^2*a_k/(-256)^k ~ 0.75(-9/16)^k/(k*pi)^{1.5} and hence the series in the conjecture converges rapidly. I have contacted several famous experts at pi-series or modular forms, they have never seen such a series for 1/pi before and none of them could prove the conjecture. It seems that all known methods used to prove Ramanujan-type series for 1/pi (including the current theory of modular functions and the WZ method) do not work for this curious series. Such a new series for 1/pi should be very rare! I consider the conjecture particularly difficult and very challenging. It might appeal for a powerful tool or a new theory. Any comments are welcome! Zhi-Wei Sun http://math.nju.edu.cn/~zwsun
hello everybody, about that formula for 1/pi, it is nice , the coefficient a(k) is a binomial term The sequence a(k) is : 1, 1, 33, 97, 1729, 8001, 105441, 627873, 6989697, 48363649, 488206753, 3701949153, 35289342529, 283146701761, 2610495177057, 21695983405857, 196218339243777, 1667338615773441, 14917038493453089, 128562758660255073, 1143482133220664769, 9946278255903268929, 88205310329762729697, 771946983805271894433, 6837125121111415598721,... Which has this g.f. 1 -------------------- = 2 1/2 (1 - 2 x - 63 x ) Now, this has a closed binomial expression, of course anyhow, this series : can be programmed into : proc(k) local x; (x^2 + x + 16)^k; expand(%); coeff(%, x, k) end; and proc(k) (30*k + 7)*binomial(2*k, k)^2/(-256)^k;%*f(k); end; which gives a sequence : which converges to 24/Pi at a rate of approx. .25 digits per term. or in other words, 1000 terms = 250 digits of precision. best regards, Simon Plouffe
participants (2)
-
Schroeppel, Richard -
Simon Plouffe