[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference rusure::math

Title:Mathematics at DEC
Moderator:RUSURE::EDP
Created:Mon Feb 03 1986
Last Modified:Fri Jun 06 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:2083
Total number of notes:14613

1651.0. "unsolved , fourier series related, expansion, closed form" by STAR::ABBASI (I spell check) Sun Aug 09 1992 23:10

     no one has been able to find a closed form sum for 

      oo
      --       
      \      1/n^3
      /   
      --
     n=1

    although  the 1/n^2  sum is easily shown to be (Pi^2)/6 and Euler showed 
    thatthe sum     
     
                 1           2k
               ------  =  r P      , where r is a rational number.
               n^(2k)


    one can conjecture that the sum 1/n^3  might be a rational multiple
    of Pi^3, no one has been able to prove this.

    /Nasser 
T.RTitleUserPersonal
Name
DateLines
1651.1what about other than 3?STAR::ABBASII spell checkMon Aug 10 1992 04:367
    What about   sum(n=1..oo) 1/n^p   for p>3
    
    do we know anything about them? i.e do we have a value for this sum?
    we know that for p=3, it is not known, does that mean for all p>= 3 it
    is also not known?
    
    /nasser
1651.2more infoSTAR::ABBASII spell checkMon Aug 10 1992 15:522
    I asked about this, all even sums are known, i.e any 
    sum(n=1..oo) 1/n^p  where p is even is known.
1651.3On the basis of 15 minutes of researchVMSDEV::HALLYBFish have no concept of fire.Mon Aug 10 1992 20:5320
       N   sum(1/j^N) very approximately (i.e., BASIC single precision)
    
       2   1.64473	Pi^2/6
       3   1.20205	Pi^3/25.8
       4   1.08232	Pi^4/90
       5   1.03693	Pi^5/295
       6   1.01734	Pi^6/945
       7   1.00835	Pi^7/2995
       8   1.00408	Pi^8/9450
       9   1.00201	...
    
    On this tissue of evidence I conjecture that
    
    	IF R[2k] is defined by:  sum(n=1..oo) 1/n^p = R[2k]*Pi^2k,
    
    	THEN R[2k+1] = SQRT(R[2k]*R[2k+2]).
    
      John
    
    dictated but not spell-checked :-)
1651.4closed formula for even N'sSTAR::ABBASII spell checkTue Aug 11 1992 04:5824
    >   5   1.03693	Pi^5/295
    you get the 295 offcourse by doing  Pi^5/1.03693, and approximate
    to it. 
    the problem I think is that we dont know if the multiplier of
    Pi^N (when N is odd is rational or irrational), I think that is
    the problem here.

    can you see a pattern for the odd N's multipliers? 

    the values for even N can all be obtained anlytically exactly
    the formula is (for even N's):
                                          2k
                                    (2 Pi)
            sum(n=1..oo) 1/n^2k = ---------- | B_2k |
                                    2 (2K)!

    the books says, this holds for all natural numbers K, where B_2k are
    the Bernoulli numbers. (you can see if your even N results matches the
    above formula).

    will talk more on this later..

    /Nasser
    I spell checked (almost)
1651.6Riemann zeta functionCX3PT2::KOWTOW::J_MARSHTue Aug 11 1992 17:0610
    FWIW,
    
        Sum 1/(n^k)  n = 1 ... infinity
    
    equals the Riemann zeta function with argument k.
    
    Perhaps there exist efficient routines for calculating the Riemann zeta
    function?
    
        -- Jeff
1651.7GAUSS::ROTHGeometry is the real life!Tue Aug 11 1992 17:1615
    You're asking for zeta(3) which is known to be irrational, but
    it is not known if it is made up of any simple relation involving
    pi or not.

    You can evaluate the sum accurately with Euler Maclurin summation
    by basically thinking of the sum as a trapezoidal rule approx to
    an integral and expressing the error comitted as an asymptotic
    expansion involving the odd order derivatives at the endpoints
    of summation.  Maple would do this for you without your having
    to even think about it, but I don't have access to it right now.

    People have evaluated numerous continued fraction convergants of
    this in the hopes of finding gold there...

    - Jim
1651.8We've got computers, we're tapping phone lines,...SSAG::LARYLaughter & hope & a sock in the eyeTue Aug 11 1992 18:0248
1651.9Proof of previous accuracy claimSSAG::LARYLaughter & hope & a sock in the eyeTue Aug 11 1992 19:4232
1651.10"You're no Dave Hilbert"VMSDEV::HALLYBFish have no concept of fire.Tue Aug 11 1992 21:346
> Anyone have a BIGNUM package and some computer time?
    
    I just picked up the MP package from note 26.6 and will soon be making
    good use (VAX 9000-400) of Approx(K) to verify my earlier conjecture. :-)
    
      John
1651.11In that case...SSAG::LARYLaughter & hope & a sock in the eyeWed Aug 12 1992 06:5612