


12 Other binomial coefficientsThere's not just central binomial coefficients in life! We can also find some series with other combination to the denominator, for example. An other idea is also useful : The numerous series with can cleverly be accelerated by taking uniquely part of the terms in this series, for example by keeping the . Here is a little lot of series giving , or , and who are most likely not all known. Followed by the proof of a few of them. A few are among the fastest known rational series! Unless otherwise stated, all the series are personal discovery, ignoring any reference I don't know of!
12.1 Primitive formulaeIn the whole document, we will call primitive formula those that minimise the degree of considered polynomials in the series, and who minimise the number of members of series such as the BBP binomial considered a few paragraph lates. In fact, for a polynomial binomial formula , the decomposition into even and odd parts (sum on amd ) gives another serie but which is still equivalent. This said, maybe all the formulae that follows are not primitive, it's sometime hard to see!
12.2 Factorial polynomials formulaeFirst of all, we are interested in series of the form , generalisation of the previously seen central binomial series .
Such a simplicity, it's beautiful... We have , which allows us to conclude that the previous serie gives just a bit more than one decimal per term, i.e. a speed of roughly .
whom I give two proofs after all those formulae.
this last fform is not random... as we will see in part 12.4. [link]. Note that which is not uninteresting from a calculation point of view! But wait to see the rest.... I remind you here that if I write , this means that we already gains more than one decimal by iteration. The exact calculation is done by using the decimal logarithm (because it's the reciprocal of the function hence this gives us the number of decimals, in base 10, equivalentes to the given number) Here, is the are very big in front of very quickly.
I found nothing.... which does not mean there exist nothing !
Note that
The last formula is among those that make a appear but no for the same power in the denominator... Note that .
It's the order of Bellard's relation. It's a particular order, because is an odd number ( !). Numeriquely, it's the only order (at least I think so) for which we can find a coefficient implied.
but also
Concerning the speed of the convergence, we have
With
We have
This time, we have
At equivalent levels, we have
With
The speed is
the speed is :
with
with
with Note on the way that ! ! The last formula adds a bit more than 6 new decimals at each iteration ! It is now better than the best rational series of Ramanujan !
. Impossible unfortunatly to find a formula for .
where
where but also where And if we look at the speed of convergence, we get which gives at least 12 new decimals at each step of the serie ! Even with it's apparent complexity, it's a rational serie, hence simple to put to work. The calculation of the central binomial coefficeint can as well be done in a recursive way from one step to the next.
where
12.3 So, what to make of all of this ?Several things need to be noted :
Exemple : In dront of the coefficient of of the last serie (denominator of the fraction in fron of the serie), we have but on the other hand the first coeefient of the brackets is factorise as follow : (which is a lot less simple !).
Note 24 Since I wrote this document, I found an article printed in octobre 2001 [7] which present the fundamental research principles of such formulae, and which shows that we can find some series as fast as we with with the central binomial coefficients of type .
12.4 ProofsThose formulae seems difficult to proof because the functions they represent and hence the differential equations that they satisfy have few chances of being simples... The differential equations are most likelt very complicated, but we be a bit cunning. Notice that we already know the sum
and that the serie is the even composant of the previous serie. Then, we have two method that can seem natural. A third then appeared when following [7].
Let us pay attention to the case of the serie . First of all, we have . We need therefore to extract to the first serie 513 part of it's members (those in ). We introduce
They are, more or less, the even and odd composant of ... more precisely, Let us now find a relation between the functions and : from which if we derive the relation from 515, we get
The right hand side is not very nice, but it contains a. We just now need to let to find
let
and it is the serie we were looking for. We can also let to find
this also allows to find nearly the same relations for . Finnaly, we can use the famous relation to obtain
This case works we find ourself with the two equations for and , which allows us to come out with a quite useful differential equation. If we divide in the same way in three part so for example to find some series in , nothing is garented ! In a general way, the differential equations will most likely be unsolvable, but we can use them to find a few relations.
when is prime, two cases are possible: is not a multiple of , so since the , are the th distinct root of unity, . If is a multiple of , each is worth , hence . With all of this, we obtain the sum only on the multiples of , i.e.
Let us apply all of this without further ado ! But I will only detail one case, because it is quite a lot of work still... Let us take the case with the serie . We obtain on one hand
and on the other By bringing those two expression together and composing with , we obtain
We can see that we can directly obtain with this form a serie giving since we can cancel thw term in front of the logarithm (which we then obtain a diverging series if we had the idea to multiply the expression by and take ...). We need to derive the serie 528, which after multiplication by gives: it's not very nice... but by doing , we get
and we can also use an extra differention so to make appear a serie in , but that completly ugly ! by letting , we get
Starting form here, we can use 530 and 532 to obtain then
There we go ! Might as well say that the other series in can be deduced in the same way while the method seems more complicated to use for example for the series in . If we step back to look at the two method explained above, we note that the first, is based on differential equation, gives accurate information from wehre comes the coefficients of polynomial in by giving us directly the formuation formula of those coefficient through differential equation. The second gives more fredom in concerning the produced series since we have the exact expression of the serie.
12.5 Fast combinations: Factorial formulae BBPIn the same way as the 12.2, we can find some factorial formulae having the BBP series form. There are as fast! We are therefore interested in series with the form , generalisation of BBP series. Here's a little anthology, among which the proof for Guillera's formula is given. We will work out during this that the method is not that different from the second one presented for non BBP fast factorial formulae. Then a method for a more general proof inspired by the idea [7] will have it's own special section ! Note that on the contrary to polynomial factorial formulae, here it's is very fundamental to find some series that we will call "primitive" because we can easily see that a formula in will mechanicly give birth to a formula in by division of the sum into even parts () and odd parts () then bringing together the terms. To a formula is also associated a formula in , etc... But it is not sure that I have alway written here uniquely some "primitive" formulae ! Doesn't matter, they are so beautiful :) We are at least sure that for a sum , if , we have a primitive formula... An example yet again to understand this deception in the case of binomial BBP formulae: to artificially accelerate the series we can reorganise the terms in such a way so to obtain for example but this can be seen when we factorise the integers which then have the annoying tendence of being quite simple... Typical example, has Jesus Guillera reminded me. The formula which seems very fast, is essentialy reducable to the formula since this breaks down to take pratically. We can see that the integers coefficients that are used are very simple ( mostly).
As with Bellard's formula, we can find a lot of very interesting sums for the
We also obtain as often some representations of 0, uniquely for the combination which gives values to some remarquable constants ( and ).
By looking onto the side of the powers of 3, we can also find some happiness
but to be truthful, that is it!
We don't know any formula for ...
Note that hear also we can not apparently find similar formula for , which is quite suprising!Furthermore, the repartition of the signs of the terms in the brackets does not seem to be random at all... Is it really a primitive formula ? ?
Jesús Guillera gave this very nice and simple formula in november 2001 but it is not a real primitive formulae but is more from a formula in .
The following formulae are most likely not primitive formulae but so well.... they are still very nice :)
You will have noticed that , that's really nice !
the speed is of
where
where We can also find a function of the same kind as , which represent the fastest way since a long time to calculate 0 ! !
If this is not beautiful.... admire the perfectly regular decrease in the integer coefficients.... Concerning the speed, we have : i.e. 18 new decimals at each itteration, great! But obviously, more terms are needed to be calculated one in the other...
12.6 So, what does it all mmean?This time again, a few things to note :
12.7 Typical ProofJesús Guillera and myself offer here a method for proof for those formulae (which does not involve ), this is done to show the existance of this kind of proof for each formulae, followed by an application of the first formula of the section. This method was inspired from the one [7], by atempting to go just a bit further in the detail...
12.7.1 La méthodeThe serie is presented under the form
Great... We use the integral representration of the function Beta so to directly obtain that
which gives us the sum from which we can deal with by decomposition of the denominator into simple elements (careful, I never said it was easy ! :) ). Good, but what do we do for the , ? ? For a fixed , the decomposition into simple elements of seing it's a rational fraction in n gives a sequence such that
with . For all values from to , we then have some sequences that we can linearly combine so to form the coefficients of the sum . This is the same as writing down and solving the system
The vector B contains the coefficients of the linear combination of the integrals containing , which gives the polynomial of degree such that There we go, it's not that hard ! We can also, if we worry about the construction of formulae and not of proofs, choose a polynomial which voluntary simplify certain divisors of the denominator of the equivalent integral. We then found ourself in a situation which I spend time on in 12.7.4.
12.7.2 Application : Proof of the first formulaWe take yet again the first formula by Guillera
We use the integral formula
which is proved by recurrance for example for the pure mathematician! We deduce that For , it's a bit more complicated, butwe can found our way around anyway by following the method of the above section, know that
We have hence
which is equivalent to considering the famous polynomial we are looking for is because we have
since the polynomial is simple, we can explicitely determine it, but this will not always be the case (see proof below). The calculation is now direct hence finaly by recopying the method of 6.2by Gery Huvent , we have
We now choose so to cancel down the participation of our dear and obtain Guillera. We can also let so to obtain 541.
12.7.3 Proof of the formula inJesus Guillera and myself now offer you a quick proof of one of the best formula in the packet, 546. We remind ourself that the principal is to find a polynomial such that While the solution, for each k, is not unique, we know that the degree of is . By the method of linear system, we get Now, we put it together....
With the of the formula 546, we have and
Incredible, no ? ? That this quite big sum is in fact equivalent to a very simple integral, it's great!
12.7.4 Predictions of formulaeLooking at the proof, we might ask ourself if there exist a way to predict for which combinations there exists a formula. I have not for the moment a complete answer, but a sufficient condition is already quite simple to show. We have seen in fact with the formula in that the integral was equivalent to . This comes from the fact that divides and the polynomial in the numerator (hence the coefficients) is only used to simplify the other factors. But for non alternating formulae, the polynomial in the denominator comes from which we will call a generating polynomial. Starting from that, a sufficient existance condition for a formula for is that Hence we need that and are roots of . In particular, we have for , , . This proof the existance for a formula in for . But since and are 4th root of , we can multiply by without changing the existance of the roots and . This then proof the existance of a formula in . Let us try to specify the sufficient condition :
by conjugate by using modulus and argument
Things are clear. So that we can obtain a non alternating factorial BBP formula thanks to the integral , it is necessary and sufficient that is a power of , even and smaller than and most of all the great relation of congruence . We can easily check that the conditions satisfy those conditions. We also find that the condition is satisfied for , formulae that I missed in my experimentations! Just to show, that sometimes the theory is faster than the pratical... :) By applying the same method to alternating series, to the roots (which allows us to find thanks to ), to the polynomial (so to find ), we find the following conditions, and hence the following formulae : For nonalternating series
For alternating series
12.8 Product of combinaisonsA very interesting questiong concern the possible presence of several combinations in a serie giving . I have to admit that I thought this was very improbable, until I discovered the following formula in december 2001, thanks to Jesús Guillera
The same with factorials
We also have
or
So, where does this comes from ? Well instead of starting from integers power in the integral, we use rational powers and in particular square roots. In fact, considering the integral
we obtain sums of the form
or for example for and
or even for and
The BBP sums are then deduced after integration so to give formulae of the type
For the first formula of Guillera, we consider for example the following proof Proof. and we then use the known values of . _ An other example contains where is the elliptical function of first sort in the first singular value, famous constant of elliptical theory ! It is obtained from
and
and the integral
All of this open some very interesting perspectives ! Equaly note that the BBP form is is a very general form of series in the sense where even the formulae like the ones by Ramanujan can be put under BBP form, like
On the other hand, unfortunatly, we still have not find a method to pove those formulae with the method Bêta... A lot more details and a few other formulae will be given in the article [13], available sometime soon I hope !
back to home page 