IV .
An Attempt towards the Improvement of the Method of approximating , in the Extraction of the Roots of Equations in Numbers .
By Brook Taylor , Secretary to the Royal Society .
IN Phil. Tran .
No. 210 .
Dr. Halley , now Secretary of the Royal Society , has published a very compendious and useful Method of extracting the Roots of affected Equations of the common Form , in Numbers .
This Method proceeds by assuming the Root desired nearly true to one or two Places in Decimals ( which is done by a Geometrical Construction , or by some other convenient way ) and correcting the Assumption by comparing the Difference between the true Root and the assumed , by means of a new Equation whose Root is that Difference , and which he shows how to form from the Equation proposed , by Substitution of the Value of the Root sought , partly in known and partly in unknown Terms .
In doing this he makes use of a Table of Products ( which he calls Speculum Analyticum , ) by which he computes the Coefficients in the new Equation for finding the Difference mentioned .
This Table , I observed , was formed in the same Manner from the Equation proposed , as the Fluxions are , taking the Root sought for the only flowing Quantity , its Fluxion for Unity .
and after every Operation dividing the Product successively by the Numbers 1 , 2 , 3 , 4 , &amp;c. Hence I soon found that this Method might easily and naturally be drawn from Cor. 2 .
Prop. 7 .
of my Methodus Incrementorum , and that it was capable of a further degree of Generality ; it being Applicable , not only to Equations of the common Form , ( viz. such as consist of Terms wherein the Powers of the Root sought are positive and integral , without any Radical Sign ) but also to all Expressions in general , wherein any thing is proposed as given which by any known Method might be computed ; if vice versa , the Root were considered as given : such as are all Radical Expressions of Binomials , Trinomials , or of any other Nomial , which may be computed by the Root given , at least by Logarithms , whatever be the Index of the Power of that Nomail ; as likewise Expressions of Logarithms , of Arches by the Sines or Tangents , of Areas of Curves by the Abscissa 's or any other Fluents , or Roots of Fluxional Equations , &amp;c. For the sake of this great Generality , it may not be improper to show how this Method is derived from the foresaid Corollary .
Therefore z and x being two flowing Quantities ( whose Relation to one another may be expressed by any Equation whatsoever ) by this Corollary , while z by flowing uniformly becomes z+ v , x will become x+ x/ 1 .
zv+ x/ 1 .
2 z2 v+ x/ 1 .
2 .
3 z3 v3 + &amp;c. or x+x v/ 1 +x v2/ 1 ~2+x v3/ 1 .
2 .
3+ &amp;c. for z putting 1 .
Hence if y be the Root of any Expression formed of y and known Quantities , and supposed equal to nothing , and z be a part of y , and x be formed of z and the known Quantities , in the same manner as the Expression made equal to nothing is formed of y ; and let y be equal to z+ v : the difference v will be found by Extracting the Root of this expression x+x v/ 1 +x v2/ 1 .
2+x v3/ 1 .
2 .
3 + &amp;c. = 0 .
For in this Case z being become z+v= y , x , which is now become x+xv+x v2/ 2 + &amp;c. must become equal to nothing .
The Root v in the Equation x+x v/ 1 +x v2/ 1 .
2+x v3/ 1 .
2 .
3 + &amp;c. = 0 , is to be found upon the Supposition of its being very small with respect to z , ( as it must be , if z be taken tolerably exact ) by which means the Terms x v3/ 1 .
2 .
3+x v4/ 1 .
2 .
3 .
4+ &amp;c. may be neglected , upon account of their smallness with respect to the other Terms , so as to leave the Equation x+x v/ 1 +x v2/ 1 .
2= 0 , for finding the first approximation of v. By extracting the Root of this Equation , we have v=~ x2/ x2 2x/ x x/ x. That is , First , ~ x2/ x2 2x/ x x/ x , if x+xv+x v2/ 2 = 0 .
Sec. ~ x2/ x2 + 2x/ x x/ x , if x+xv+x v2/ 2 = 0 .
3 .
x/ x ~ x2/ x2 2x/ x , if xxv+x v2/ 2 , &amp;c. = 0 .
4 .
x/ x ~ x2/ x2 + 2x/ x , if xxv+x v2/ 2 , &amp;c. = 0 .
This approximation gives v exact to twice as many places as there are true Figures in z , and therefore trebles the number of true Figures in the Expression of y by z+ v , which may be taken for a new Value of z , for computing a second v , seeking other Values of x , x , x , &amp;c. Tho ' when z is tolerably exact ( which it may be esteemed when it contains two or three or more true Figures in the Value of y , according to the Number of Figures the Root is proposed to be computed to , ) the Calculation may be restored without so much trouble , only by taking ~ x2/ x2 ~2 x/ x 2 x/ 2 .
3x v3 2 x/ 1 .
2 .
3 .
4x ~4 &amp;c. instead of ~ x2/ x2 ~2 x/ x taking every time for v its Value last computed .
From the same Equation x+xv+x v2/ 2 +x v3/ 1 .
2 .
3 + &amp;c. = 0 , may be gathered also a rational Form , viz. v= x/ x x x/ 2 x For neglecting the Terms x v3/ 1 .
2 .
3 , &amp;c. we have v= x/ x + x/ 2 v which is nearly = x/ x. Therefore in the Divisor instead of v writing x/ x we have more exactly v= x/ ~ ~ x/ 2 ~ , that is 1 .
x/ ~ ~ x/ 2 ~ , when x+~v+~ v2/ 2 &amp;c. = 0 .
2 .
x/ ~ +~ x/ 2 ~ , when x+~v+~ v2/ 2 &amp;c. = 0 .
3 .
x/ ~ ~ x/ 2 ~ , when x~v+~ v2/ 2 &amp;c. = 0 .
4 .
x/ ~ +~ x/ 2 ~ , when x~v+~ v2/ 2 &amp;c. = 0 .
This Formula will also triplicate the number of true Figures in z. And the Calculation may be repeated , after every Operation , taking for a Divisor ~~ ~/ 2 v+ ~ v2/ 1 .
2 .
3+~ v3/ 1 .
2 .
3 .
4+ &amp;c. instead of x+~ x/ 2 ~ .
Dr. Halley has fully explained the manner of using both these Formula 's in AEquations ~ the common Form ; wherefore I shall be the shorter in explaining two or three Examples of another sort .
Ex. I. Let it be proposed to find the Root of this Equation y2 + 1~ ~2 +y 16 = 0 .
In this Case , for y writing z , and for 0 writing x , we have z2 + 1~ ~2 +z 16 = x. Whence by taking the Fluxions , we have x~ =2~2xzx z2 + 1~ ~2 1+ 1 , and ~= 2~2x84~2 z2 x z2 + 1~ ~2 2 .
For finding the first Figures of the Root y , for ~2 take 3/ 2 , and we have the Equation y2 + 1~3/ 2 +y 16 = 0 , which being expanded gives y6 +3 y4 +2 y2 + 32 y 255 = 0 .
By this Equation I find that for the first supposition we may take z= 2 .
Therefore in order to find v , let us now make ~2= 7/ 5 , ( which is nearer than before ) and we have x= z2 + 1~7/ 5 +z 16 = 22 + 1~7/ 5 14 = 57/ 5 14 = 4,48 ; ~= 10 , 66 ; ~= 4,72 .
Whence by the second rational Form v= 4,48/ 10 , 66 + 4 , 72 x 4 , 48/ 2 x 10 , 66 = 0 , 38 ; which must be too big , because 7/ 5 &lt; ~ 2 , and therefore will require a larger Value of y to exhaust the Equation , than where ~2 is exact .
For the second supposition therefore , let us take z= 2 , 3 , and make ~2 = 1 , 4142136 , and by help of the Logarithms we shall have z2 + 1~ ~2 = 13 , 47294 , whence x= 0 , 22706 ; ~= 14 , 93429 , and ~= 5 , 18419 .
Hence by the 2d .
irrational Formula v=~ 14 , 934292/ 5 , 184192 + 0 , 45412/ 5 , 18419 14 , 93429/ 5 , 18419 = 0 , 01516 , which gives y=z+v= 2 , 31516 , which is true to six Places .
If you desire it more exact than to the extent of the Tables of Logarithms , taking z= 2 , 31516 for the next supposition , the Calculation must be repeated by computing of zz+ 1~ ~2 to a sufficient number of Places ; which must be done by the Binomial Series , or by making a LogaB bbbb2 rithm rithm on purpose , true to as many places as are necessary .
Ex. II .
For another Example , let it be required to find the Number whose Logarithm is 0 , 29 , supposing we had no other Table of Logarithms but Mr. Sharps of 200 Logarithms to a great many places .
This amounts to the resolving this Equation ly= 0 , 29 , or lie 0 , 29 = 0 .
Hence therefore we have x=lx 0 , 29 , ~= a/ z ( a being the Modulus belonging to the Table we use , viz. 0 , 4342944819 , &amp;c. ) ~= a/ z2 , ~=2 a/ z3 , ~=6 a/ z4 &amp;c. In this Case because ~ has a negative Sign , changing the Signs of all the Coefficients , the Canon for v will be found in the fourth Case , which in the irrational Form gives v=~~ ~2/ ~2 +2 x/ ~ 2 ~/ 2 .
3~ v3 2 ~/ 2 .
3 .
4~ v4 &amp;c. =z~ z2 +2lz 0 , 58/ a x z2 +2 v3/ 3 z2 v4/ 4 z2 +2 v5/ 5 z3 ~c .
In this Case to avoid often dividing by z , it will be most convenient to compute v/ z , which is got from this Equation v/ z =1~1+2lz 0 , 58/ a + 2 v3/ 3 z3 2 v4/ 4 z4 +2 v5/ 5 z5 , &amp;c. The nearest Logarithm , in the Tables proposed , to the proposed Logarithm 0 , 29 is 0 , 2900346114 , its Number being 1 , 95 .
Therefore for the first supposition taking z= 1 , 95 , we have x ( = lz 0 , 29 = 0 , 2900346114 0 , 29 ) = 0,0000346114 , and 2lz 0 , 58/ a = 0 , 0000692228/ 0 , 4342944819 = 0 , 00015939139 , and 1+2lz 0 , 58/ a = 1 , 00015939139 Whence for the first approximation we have v/ z =1~ 1 , 00015939139 = 0 , 00007969247 , and v= 0 , 00015540032 , and y=z+v= 1 , 94984459968 .
Which is true to eleven places , and may easily be corrected by the Terms 2 v3/ 3 ~ &amp;c. which I leave to the Readers curiosity .
Being upon the Subject of Approximations , it may not be amiss to set down here two Approximations I have formerly hit upon .
The one is a Series of Terms for expressing the Root of any Quadratick Equation : and the other is a particular Method of Approximating in the invention of Logarithms , which has no occasion for any of the Transcendental Methods , and is expeditious enough for making the Tables without much trouble .
A general Series for expressing the Root of any Quadratick Equation .
Any Quadratick Equation being reduced to this Form xx mqx+my= 0 , the Root x will be expressed by this Series of Terms .
x= y/ q +A~ 1/ m q2/ y 2+B~ 1/ a2 2+C~ 1/ b2 2 +D~ 1/ c2 2 &amp;c. Which must be thus interpreted .
1 .
The Capital Letters A , B , C , &amp;c. stand for the whole Terms with their Signs , preceding those wherein in they are found , as B=A~ 1/ m q2/ y 2 .
2 .
The little Letters a , b , c , &amp;c. in the Divisors , are equal to the whole Divisors of the Fraction in the Terms immediately preceding ; thus b= a2 2 .
For an Example of this , let it be required to find ~ 2 .
Putting ~2=x+ 1 , we have x2 +2x1= 0 , which being compared with the general Formula , gives mq= 2 , and my= 1 : therefore sor m taking 1 , we have q= 2 , and y= 1 , which Values substituted in the Series give x= 1/ 2 1/ 2 ~6 1/ 2 ~6~ 34 1/ 2 ~6~ 34 ~ 1154 1/ 2 ~6~ 34 ~ 1154 ~ 1331714 , &amp;c. The Fractions here wrote down giving the Root true to twenty three Places .
A new Method of computing Logarithms .
This Method is founded upon these Considerations .
1 .
That the Sum of the Logarithms of any two Numbers is the Logarithm of the Product of those two Numbers Multiplied together .
2 .
That the Logarithm of Unite is nothing ; and consequently that the nearer any Number is to Unite , the nearer will its Logarithm be to 0 .
3dly .
That the Product by Multiplication of two Numbers , whereof one is bigger , and the other less than Unite , is nearer to Unite than that of the two Numbers which is on the same side of Unite with its self ; for Example the two Numbers being 2/ 3 and 4/ 3 , the Product 8/ 9 is less than Unite , but nearer to it than 2/ 3 , which is also less than Unite , Upon these Considerations , I found the present Approximation proximation ; which will be best explained by an Example .
Let it therefore be proposed to find the Relation of the Logarithms of 2 and of 10 .
In order to this , I take two Fractions 128/ 100 and 8/ 10 , viz. 2 7/ 10 2 and 2 3/ 10 1 whose Numerators are Powers of 2 , and their Denominators Powers of 10 ; one of them being bigger , and the other less than 1 .
Having set these down in Decimal Fractions in the first Column of the Table annexed .
against them in the second Column I set A and B for their Logarithms , expressing by an Equation the manner how they are Compounded of the Logarithms of 2 and 10 , for which I write l2 and l 10 .
Then Multipleing the two Numbers in the first Column together , I have a third Number 1 , 024 , against which I write C for its Logarithm , expressing likewise by an Equation in what manner C is formed of the foregoing Logarithms A and B. And in the same manner the Calculation is continued ; only observing this Compendium , that before I Multiply the two last Numbers already got in the Table , I consider what Power of one of them must be used to bring the Product the nearest to Unite that can be .
This is found , after we have gone a little way in the Table , only by Dividing the Differences of the Numbers from Unite one by the other , and taking the Quotient with the nearest , for the Index of the Power wanted .
Thus the two last Numbers in the Table being 0 , 8 and 1 , 024 , their Differences from Unit are 0 , 200 and 0 , 024 ; therefore 0 , 200/ 0 , 024 gives 9 for the Index ; wherefore Multiplying the ninth power of 1 , 024 by 0 , 8 , I have the next Number 0 , 990352031429 , whose logarithm is D=9C+ B. In seeking the Index in this manner by Division of the Differences , the Quoreint eight generally to be taken with the least : but in the present case it happens to be the most , because instead of the Difference between 0 , 8 and 1 , we ought strictly to have taken the difference between the reciprocal 1 , 25 and 1 , which would have given the Index 10 ; and that would be too big , because the Product by that means would have been bigger than 1 , as 1 , 024 is .
Whereas this Approximation requires that the Numbers in the first Column be alternately greater and less than 1 , as may be seen in the Table .
When I have in this manner continued the Calculation , till I have got the Numbers small enough , I suppose the last Logarithm to be equal to nothing .
Which gives me an Equation , from which having got away the Letters by means of the foregoing Equations , I have the relation of the Logarithms proposed .
In this manner if I suppose G= 0 , I have 2136 l2 643 l 10 = 0 .
Which givesthe Logarithm of 2 true in seven Figures , and too big in the Eighth ; which happens because the Number corresponding with G is bigger than Unite .
There is another Expedient which renders this Calculation still shorter .
It is founded upon this Consideration , that when x is very small 1+ x~n is very nearly 1+n x. Hence if 1+ x , and 1z are the two last Numbers already got in the ~ Column of the Table , and their Powers 1+ x~m and 1 z~n are such as will make the Product 1+ x~m x1+ z~n very near to Unite , m and n may be found thus : 1+ x~m =1+m x , and 1 z~n =1n z , and consequently 1+ x~m x1 z~~ =1+mxnzmnz x , or ( neglecting mnz x ) 1+ mxn z. Make this equal to 1 , and we have m:n ~ z : x : : l1 z : l1+ x. Whence xl1z+zl1+x = 0 .
To give an Example of the Application of this , let 1 , 024 and 0 , 990352 be the last Numbers in the Table , their Logarithms being C and D. Then we have 1 , 024 =1+ x , and 0 , 990352 =1 z , and consequently x= 0 , 024 , and z= 0 , 009648 .
Whence the Ratio z/ x in the least Numbers is 201/ 500 .
So that for finding the Logarithms proposed we may have 500 D+ 201 C= 48510 l2 14603 l 10 = 0 , which gives l2= 0 , 3010307 , which is too big in the last Figure ; but it is nearer the truth , than what is got from the Logarithm F supposed equal to nothing .
So that by this means we have saved four Multiplications , which were necessary to find the Number 9989595 &amp;c. correspondent to F , and which must have been had if we would make the Logarithm true to the same Number of places without this Compendium .
1 , 280000000000 A=7l22l 10 l2 &gt; 0 , 28 0 , 800000000000 B=3l2l 10 &lt; 0 , 33 1 , 024000000000 C=B+A= 10 l23l 10 &gt; 0 , 300 0 , 990352031429 D=C+B= 93 l2 28 l 10 &lt; 0 , 30107 1 , 004336277664 E=2D+C= 196 l2 59 l 10 &gt; 0 , 301020 0 , 998959536107 F=2E+D= 485 l2 146 l 10 &lt; 0 , 3010309 1 , 000162894165 G=4F+E= 2136 l2 643 l 10 &gt; 0 , 30102996 0 , 999936281874 H=6G+F= 13301 l2 4004 l 10 &lt; 0 , 301029997 1 , 000035441215 I=2H+G= 28738 l2 8651 l 10 &gt; 0 , 3010299951 0 , 999971720830 K=I+H= 42039 l2 12655 l 10 &lt; 0 , 3010299959 1 , 000007161046 L=K+I= 70777 l2 21306 l 10 &gt; 0 , 30102999562 0 , 999993203514 M=3L+K= 254370 l2 76573 l 10 &lt; 0 , 30102999567 1 , 000000364511 N=M+L= 325147 l2 97879 l 10 &gt; 0 , 3010299956635 0 , 999999764687 O= 18 N+M= 6107016 l2 1838395 l 10 &lt; 0 , 3010299956640 Com. Are .
235313 0= 364511 O+ 235313 N= 2302585825187 l2 693147400972 l 10 &gt; 0 , 301029995663987 I have computed this Table so far , that the Reader may see in what manner this Method Approximates ; this whole Work , as it appears , costing a little more than

