[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

920.0. "Friday afternoon problems again." by HPSTEK::XIA () Fri Aug 19 1988 15:04

    Friday afternoon problems again (Don't laugh, Dan).
                  oo    1 
    1. Let f(x) = sum  ---  
                  n=1  n^x  
    
    Prove that f is continuously differentiable for x > 1.
    (Comment this function is called Riemann function).
           
            oo   n^2 + 1
    2. find sum  ------------ x^n (in closed form that is).
            n=0  (2^n) * (n!)                             
            
            oo         1
    3. find sum (-1)^n -  (This is truely easy).
            n=0        n
T.RTitleUserPersonal
Name
DateLines
920.1HPSTEK::XIAFri Aug 19 1988 15:074
    These problems are all from a book written by a Russian (whose name
    I can neither pronouce nor type out in alphebet).  The title of
    the book sounds something like: Problems in Analysis.
    Eugene
920.2CLT::GILBERTFri Aug 19 1988 18:5226
>            oo   n^2 + 1
>    2. find sum  ------------ x^n (in closed form that is).
>            n=0  (2^n) * (n!)                             

    Well,
                 oo  x^n
        exp(x) = sum ---
                 n=0 (n!)

                   oo     x^n
        exp(x/2) = sum ----------
                   n=0 (2^n) (n!)

                        oo  n * x^(n-1)
        d/dx exp(x/2) = sum ----------- = exp(x/2) / 2
                        n=1 (2^n) (n!)

                                oo  n^2 * x^(n-1)
        d/dx (x * exp(x/2)/2) = sum ------------- = x/4 * exp(x/2) + exp(x/2)/2
                                n=1  (2^n) (n!)

    So,

        oo      n^2 + 1         x^2 exp(x/2)   x exp(x/2)
        sum  ------------ x^n = ------------ + ---------- + exp(x/2)
        n=0  (2^n) * (n!)            4             2
920.3LISP::DERAMODaniel V. {AITG,LISP,ZFC}:: D'EramoFri Aug 19 1988 20:0419
     Problem 3:
     
            oo         1
    3. find sum (-1)^n -  (This is truely easy).
            n=0        n

     First, we invoke the FFT (Fudge Factor Theorem) to change
     the lower limit from 0 to 1.
     
     Then we just rattle off the result from memory:  - ln 2.
     
     No, seriously, if you integrate dx/(1 + x) from x=0 to
     x=1, you get ln 2 - ln 1 = ln 2.  If before integrating
     you expand the fraction as an infinite series, you get
     the integral from x=0 to x=1 of dx(1 - x + x^2 - x^3 + ...)
     Integrate this term by term to get 1 - 1/2 + 1/3 - 1/4 + ...
     which is "minus" the requested sum.
     
     Dan
920.4AITG::DERAMODaniel V. {AITG,ZFC}:: D'EramoThu Nov 17 1988 19:2010
     No one did problem 1:
     
>>                  oo    1 
>>    1. Let f(x) = sum  ---  
>>                  n=1  n^x  
>>    
>>    Prove that f is continuously differentiable for x > 1.
>>    (Comment this function is called Riemann function).
     
     Dan