Re: approximating pi



O/H tommy1729 έγραψε:
k,a,b,c,d,E,F are positive integers.

C_n_2n is a binomium.

sum n=1 -> oo

(n^k * 2^n)/ C_n_2n = a*pi + b.

lim k-> oo b/a = pi

sum n=1 -> oo

n^k/ C_n_2n = c*2*pi*sqrt(3) + d.

lim k-> oo d/c = 2*pi*sqrt(3)

sum n=1 -> oo

(n^k * 3^n)/ C_n_2n = E*pi*sqrt(3)/2 + F.

lim k-> oo F/E = pi*sqrt(3)/2

nice hmm

marry xmas

and to you! :)

regards
tommy1729
.



Relevant Pages

  • Re: Help Resource Counters Scale Better (v2)
    ... important pass to check usage under limit ... But I wonder how users can see synchronous numbers without tolerance, ... Add, if the sum reaches batch count, we sum and save ... Hmm, maybe I'm misunderstanding. ...
    (Linux-Kernel)
  • Re: Quantum communication might be possible?
    ... >>To sum up: The entanglement propagates at the speed of light. ... > Hmm. ... You have evidence for this statement, ...
    (sci.physics.research)
  • Re: No reason, just very cool.
    ... shorter than "when the wind blows", mind. ... Hmm. ... I recognised bits from Terminator II, and from "The Sum of ...
    (uk.rec.sheds)
  • Re: matmul trouble
    ... It was sum. ... Hmm. ... Perhaps a pattern. ... sounding like compiler instalation issues again.. ...
    (comp.lang.fortran)
  • Re: Subset sum question
    ... I think I understand your construction. ... Hmm, it seems quite hard to get all the numbers to be different. ... as coming up with examples where lots of subsets have the same sum. ... rephrasing the question would be the most help. ...
    (comp.theory)