the great magnitude of b , 2b , 3b , 4b , 5b , 6b , 7b , &amp;c. in comparison of 1 , will be almost equal to ( though somewhat greater than ) 1+ 1/ b AX + b/ 2b BXX + 2b/ 3b CX3 + 3b/ 4b DX4 + 4b/ 5b EX5 + 5b/ 6b FX6 + 6b/ 7b GX7 + 7b/ 8b HX8 + &amp;c. or 1+ 1/ b AX + 1/ 2 BXX + 2/ 3 CX3 + 3/ 4 DX4 + 4/ 5 EX5 + 5/ 6 FX6 + 6/ 7 GX7 + 7/ 8 HX8 + &amp;c. or 1+ 1/ b x1xX + 1/ 2 x 1/ b x1x XX + 2/ 3 x~x 1/ b x1x X3 + 3/ 4 x 2/ 3 x 1/ 2 x 1/ b x1x X4 + &amp;c. or 1+ 1/ b X+ 1/ b x 1/ 2 XX + 1/ b x 1/ 3 x X3 + 1/ b x 1/ 4 X4 + &amp;c. or 1+ x/ b + xx/ 2b + x3/ 3b + x4/ 4b + x5/ 5b + x6/ 6b + x7/ 7b + x8/ 8b + &amp;c. Therefore , multiplying both sides by b , we shall have bx 1/ ~1 x 1/ b nearly =b+X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + x6/ 6 + x7/ 7 + x8/ 8 + &amp;c. ; and , subtracting b from both sides , X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + x6/ 6 + x7/ 7 + x8/ 8 + &amp;c. nearly =bx 1/ ~1 x 1/ b b=bx ~1/ 1 x 1/ b b ; that is , the proposed series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + &amp;c. will be nearly equal to bx ~1/ 1 x 1/ b b. We must therefore first subtract X from 1 , and then divide 1 by the remainder , which will give us a quotient equal to 1/ 1 x. And , having found this quotient , we must extract its bth , or 1,000,000,000,000th , root , and multiply the said root by b , or 1,000,000,000,000 ; and , lastly , from the product we must subtract b , or 1,000,000,000,000 : and the remainder thereby obtained will be nearly equal to the proposed infinite series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + x6/ 6 + x7/ 7 + &amp;c. Q. E. I. An example of the foregoing method of summing the said infinite series .
3 .
As an example of this method of finding the value of the series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + x6/ 6 + &amp;c. let us suppose X to be equal to 9/ 10 .
Then we shall have 1X=1 9/ 10 = 1/ 10 , and 1/ 1 x= 10 .
Now , since the logarithm of 10 in BRIGGS'S System of logarithms is 1 , the logarithm of the 1,000,000,000,000th root of 10 must be the 1,000,000,000,000th part of 1 , or must be =.000,000,000,001 .
This logarithm is too small to be found in the common tables of logarithms , which go only to seven places of figures ; and therefore the number corresponding to it , that is , the 1,000,000,000,000th root of 10 , cannot be found by the help of those tables ; but it may be found in the manner following .
The 1,000,000,000,000th root of 10 is a number that is somewhat , and but a very little , greater than 1 .
That number , therefore , and 1 will represent two ordinates to the axis , or asymptote , of a logarithmick curve that are very nearly contiguous to each other : whence it follows , that the sub-tangent of the curve will bear very nearly the same proportion to the lesser ordinate 1 , as the absciss of the axis intercepted between the two ordinates , that is , as the logarithm of the ratio of the greater ordinate to the lesser , or the logarithm.000,000,000,001 , bears to the difference of the said ordinates .
Say therefore , as.434,294,481,9 ( which is the sub-tangent of the logarithmick curve in BRIGGS'S System of Logarithms ) is to 1 ( or the lesser of the two ordinates ) so is .000,000,000,001 to a fourth number , which will be .000,000,000,002,302,585,093 ; and this fourth number will be the excess of the greater of the said two ordinates above the lesser , or of the billionth root of 10 above 1 .
Therefore the billionth root of 10 will be = 1.000,000,000,002,302,585,093 ; which , being multiplied by 1,000,000,000,000 , will be = 1,000,000,000,002.302,585,093 ; from which if we subtract 1,000,000,000,000 , the remainder will be 2.302,585,093 .
Therefore 2.302,585,093 is nearly equal to the infinite series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + x6/ 6 + x7/ 7 + &amp;c. when X is = 9/ 10 .
Q. E. I. 4 .
This number 2.302,585,093 gives the value of the series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + &amp;c. exact to nine places of figures , the error being only in the 10th figure 3 , which ought to be a2 instead of a 3 , the more accurate value of that series ( which is equal to the logarithm of the ratio of 1 to 1x in NAPIER'S System of Logarithms , that is , in the present example , to the logarithm of the ratio of 1 to 1/ 10 , or of 10 to 1 , or to NAPIER'S logarithm of 10 ) being 2.302,585,092,994,04 .
5 .
I believe that similar applications of the binomial theorem may be made for the summation of other slowlyconverging infinite serieses , whenever the generating fractions ( by the multiplication of which the numeral co-efficients of the terms of such serieses are produced from each other ) are formed by the addition of a given number to both their numerators and denominators .
In our endeavours , therefore , to sum such serieses it will be proper to attend to the law of the said generating fractions .
XLI .
A Method of finding , by the Help of Sir Isaac Newton 's binomial Theorem , a near Value of the very slowlyconverging infinite Series x+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + &amp;c. when x is very nearly equal to 1 .
By Francis Maseres , Esq. F. R. S. Cursitor Baron of the Exchequer .
Read July 9 , 1778 .
ARTICLE ~ .
IF the capital letters A , B , C , D , E , &amp;c. be put for the numeral co-efficients of the powers of x in the said series , so that A shall be = 1 , B= 1/ 2 , C= 1/ 3 , D= 1/ 4 , E= 1/ 5 , and so on , we shall have B= 1/ 2 x A , C= 2/ 3 x B , D= 3/ 4 x C , E= 4/ 5 x D , &amp;c. and the series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + &amp; c will be =X+ 1/ 2 AXX + 2/ 3 BX3 + 3/ 4 CX4 + 4/ 5 DX5 + 5/ 6 EX6 + 6/ 7 FX7 + 7/ 8 GX8 + &amp;c. ; in which series the fractions 1/ 2 , 2/ 3 , 3/ 4 , 4/ 5 , 5/ 6 , 6/ 7 , 7/ 8 , &amp;c. which generate the co-efficients of the powers of X in the several terms after the first term X , are derived from each other by the continual addition of 1 to both their numerators and their denominators .
2 .
This observation suggests to us a method of finding a near value of the sum of this series by the help of Sir ISAAC NEWTON'S binomial theorem , which may be explained as follows .
If m and n represent any two whole numbers , the reciprocal of the m/ nth powers of the binomial quantity 1 x , or , according to Sir ISAAC NEWTON'S notation of powers , the quantity ~1 x -m/ n , will , according to that celebrated theorem , be equal to the infinite series .
1+ m/ n xX + m/ n x m+n/ 2n x XX + m/ n x m+n/ 2n x m+2n/ 3n x X3 + m/ n x m+n/ 2n x m+2n/ 3n x m+3n/ 4n x X4 + m/ n + m+n/ 2n x m+2n/ 3n x m+3n/ 4n x m+4n/ 5n x X5 + &amp;c. or 1+ m/ n AX + m+n/ 2nBXX + m+2n/ 3n CX3 + m+3n/ 4n DX4 + m+4n/ 5n EX5 + m+5n/ 6n FX6 + m+6n/ 7n GX7 + m+7n/ 8n HX8 + &amp;c. ; in which series the capital letters A , B , C , D , E , F , G , H , &amp;c. stand for 1 and the co-efficients of X , XX , X3 , X4 , X5 , X6 , X7 , X8 , &amp;c. Now it is evident , that the generating fractions m+n/ 2n , m+2n/ 3n , m+3n/ 4n , m+4n/ 5n , m+5n/ 6n , m+6n/ 7n , m+7n/ 8n , &amp;c. are derived from m/ n and from each other by the continual addition of n to both their numerators and denominators .
Therefore , though they are greater than they would be if m was subtracted from the numerator of each of them , that is , than the fractions n/ 2n , 2n/ 3n , 3n/ 4n , 4n/ 5n , 5n/ 6n , 6n/ 7n , 7n/ 8n , &amp;c. and consequently , than the fractions 1/ 2 , 2/ 3 , 3/ 4 , 4/ 5 , 5/ 6 , 6/ 7 , 7/ 8 , &amp;c. which are respectively equal to n/ 2n , 2n/ 3n , 3n/ 4n , 4n/ 5n , 5n/ 6n , 6n/ 7n , 7n/ 8n , &amp;c. Yet , the further we go in the series , the less is the proportion in which they exceed the latter fractions ; insomuch that , if we go far enough in the series , we may find terms in it whose proportion to the corresponding terms in the series 1/ 2 , 2/ 3 , 3/ 4 , 4/ 5 , 5/ 6 , 6/ 7 , 7/ 8 , &amp;c. shall approach as near as we please to a proportion of equality .
And , by taking n of a very great magnitude in comparison of m , we may even make the first terms of the series m+n/ 2n , m+2n/ 3n , m+3n/ 4n , m+4n/ 5n , m+5n/ 6n , m+6n/ 7n , m+7n/ 8n , &amp;c. approach very nearly to an equality with the corresponding terms of the series 1/ 2 , 2/ 3 , 3/ 4 , 4/ 5 , 5/ 6 , 6/ 7 , 7/ 8 , &amp;c. which are the generating fractions of the proposed series X+ xx/ 2 + x3/ 3 + x4/ 4 + x5/ 5 + x6/ 6 + x7/ 7 + x8/ 8 + &amp;c. In order to this , let m be taken = 1 , and n= 1,000,000,000,000 , that is , =a billion , or the square of a million , which , to avoid the frequent repetition of so many ciphers , we will call b. Then will ~1 X 1/ 1,000,000,000,000 , or ~1 X 1/ b , or 1/ ~1 x 1/ b , be =1+ 1/ b AX + 1+b/ 2b BXX + 1+2b/ 3b CX3 + 1+3b/ 4b DX4 + 1+4b/ 5b EX5 ~ 1+5b/ 6b FX6 + 1+6b/ 7b GX7 + 1+7b/ 8b HX8 + &amp;c. which , on account of

