according to the source* , this expression f(m) is a fact one "notices" in order to get the value for m infinite ...... which is 26 !

* les math au carré , by Marie-France Palissard

Started by zerocordas, Sep 23, 2016

7 replies to this topic

Posted 23 September 2016 - 06:44 AM

according to the source* , this expression f(m) is a fact one "notices" in order to get the value for m infinite ...... which is 26 !

* les math au carré , by Marie-France Palissard

Posted 24 September 2016 - 12:58 AM

The expression (n^3/2^n) is confusing. Use parentheses to clarify.

Posted 24 September 2016 - 10:59 PM

oh sure ! (n^3)/(2^n)

n^3 a classic 2^n not to mention but combined ?

Posted 28 September 2016 - 03:06 AM

First step: Use induction to show that the partial sum equals .

Second step:

Posted 29 September 2016 - 09:04 AM

sure but what if you were asked to derive f(m) from scratch ?

Posted 29 September 2016 - 08:27 PM

If you want to keep the proof elementar, you will have to put some ideas into it. Here is one possible approach:

Notice that your sum is of the form where is a polynomial. You start your proof with an educated guess, that the sum will be of similar form, namely where and are themselves polynomials (you include a polynomial term multiplied by to increase your chances of success). There is no guarantee that this will succeed, but it's a starting point. So you make trial&error.

You can be quite confident that will be of at least same degree as (sums and integrals don't tend to decrease the degree of polynomials involved). So, your first attempt is the simplest possible, where has degree 0 (turning it into a constant, possibly 0) and has degree 3.

This leads you to for some real numbers .

Evaluate at and you get a system of 5 linear equations in 5 variables. That means that IF your guess was correct then this will lead you to the only possible solution. That's the one presented in my previous post, and once you found it you can proof it by induction.

And indeed, you will find that , with the unique solution immediately resulting in the formula shown to be correct earlier.

Notice that you still have to prove it by induction, because so far this only shows that the claim is correct for .

The very same trick will work for many summation formula that are usually proved by induction.

**Edited by renerpho, 29 September 2016 - 09:13 PM.**

Posted 2 October 2016 - 02:46 AM

(1) An idea to reduce the amount of guesswork in my previous ansatz:

Because the infinite sum converges (this is easy to show), has to be a constant, and it will be equal to the value of the infinite sum. That's because , and as is a polynomial this limit only exists if is constant and is equal to the value of the infinite sum. If you already suspect the infinite sum to be equal to 26 then you can save some work by setting , reducing the number of linear equations to 4.

(2) Here is an alternative ansatz that avoids induction (for the cost of being less elementar). But it is more powerful because it can solve an infinite class of similar problems, and more elegant because there's no need for any "guesswork".

Let be a pair of real numbers, with . Notice that . Because of that sum converges. We are going to evaluate it by turning the problem into one about power series; the series involved is the one that defines the polylogarithm .

Definition:

With that, we get . Set and we get the expression . Even though the polylogarithm can not be expressed in terms of elementary functions in the general case, it can be shown to be a rational function if is a nonpositive integer, for example . This can be derived via the expression for which itself follows directly (by induction over ) by simultaneously differentiating times both sides of the equation (the well known Taylor formula for ).

All this leads to , giving the searched value.

With the same method, you can show results like , or

All of these can be shown by the induction method, too - but the computations involved become extremely ugly very, very fast. The formula for is much easier to evaluate.

**Edited by renerpho, 2 October 2016 - 04:06 AM.**

Posted 5 October 2016 - 08:30 PM

fantastic ! impressive . huge THANK

0 members, 0 guests, 0 anonymous users