Next Article in Journal
Pipeline Corrosion Prediction Using the Grey Model and Artificial Bee Colony Algorithm
Next Article in Special Issue
Does Set Theory Really Ground Arithmetic Truth?
Previous Article in Journal
A Selection Principle and Products in Topological Groups
Previous Article in Special Issue
Interval Type-3 Fuzzy Control for Automated Tuning of Image Quality in Televisions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Story of Computational Science: Colonel Titus’ Problem from the 17th Century

Department of Informatics, University of Bergen, N-5020 Bergen, Norway
Axioms 2022, 11(6), 287; https://doi.org/10.3390/axioms11060287
Submission received: 21 April 2022 / Revised: 18 May 2022 / Accepted: 22 May 2022 / Published: 14 June 2022
(This article belongs to the Special Issue 10th Anniversary of Axioms: Logic)

Abstract

:
Experimentation and the evaluation of algorithms have a long history in algebra. In this paper we follow a single test example over more than 250 years. In 1685, John Wallis published A treatise of algebra, both historical and practical, containing a solution of Colonel Titus’ problem that was proposed to him around 1650. The Colonel Titus problem consists of three algebraic quadratic equations in three unknowns, which Wallis transformed into the problem of finding the roots of a fourth-order (quartic) polynomial. When Joseph Raphson published his method in 1690, he demonstrated the method on 32 algebraic equations and one of the examples was this quartic equation. Edmund Halley later used the same polynomial as an example for his new methods in 1694. Although Wallis used the method of Vietè, which is a digit–by–digit method, the more efficient methods of Halley and Raphson are clearly demonstrated in the works by Raphson and Halley. For more than 250 years the quartic equation has been used as an example in a wide range of solution methods for nonlinear equations. This paper provides an overview of the Colonel Titus problem and the equation first derived by Wallis. The quartic equation has four positive roots and the equation has been found to be very useful for analyzing the number of roots and finding intervals for the individual roots, in the Cardan–Ferrari direct approach for solving quartic equations, and in Sturm’s method of determining the number of real roots of an algebraic equation. The quartic equation, together with two other algebraic equations, have likely been the first set of test examples used to compare different iteration methods of solving algebraic equations.
MSC:
65-03; 68-03; 01A50; 01A55; 01A60

1. Introduction

A problem brought to John Pell (1611–1685) in 1649, and discussed at the time with Silius Titus (1623–1704), was the following—to find numbers a, b, and c satisfying the equations
a 2 + b c = 16 , b 2 + a c = 17 , and   c 2 + a b = 22 .
A solution with positive integers is easily seen to be a = 2 , b = 3 , and c = 4 , but Pell decided to challenge himself by changing the final equation:
a 2 + b c = 16 , b 2 + a c = 17 , and   c 2 + a b = 18 .
In 1662, Pell left notes on their progress for Titus and by the following year he and John Wallis had successfully solved it, calculating values of a, b, and c to 15 decimal places each [1]. The solution was printed in 1685 [2], derived from the general problem
a 2 + b c = l , b 2 + a c = m , and   c 2 + a b = n .
Colonel Titus’ problem is likely the earliest instance of a problem involving three simultaneous quadratic equations ([3], p. 34) and is one of the first algebraic problems leading to a quartic equation, an equation that is not derived from a problem in geometry or trigonometry.
A variant of the Colonel Titus problem is Question 113 in Ladies’ Diary from 1725 shown in Figure 1
a 2 + b c = 920 , b 2 + a c = 980 ,   and   c 2 + a b = 1000 ,
and was solved by John Turner in 1726. Turner only specifies the quartic equation to be solved and a solution a , b , c , of (3). Question 113 is also found in algebra textbooks in 1820 ([4], p. 405) and in 1840 ([5], p. 563).
The publications of collected questions in Ladies’ Diary in 1774, 1775 [6,7], and 1817 [8] sparked new interest in Colonel Titus’ problem.
A fourth variant of the problem was published in Question 209 in The Scientific Receptacle in 1796 and shown in Figure 2:
a 2 + b c = 1 806 520 , b 2 + a c = 2 225 275 ,   and   c 2 + a b = 5 567 720 .
John Ryley solved the problem and introduced a new way to solve it by expressing a and b as a fraction of c [9].
Wallis ([2], pp. 225–256) eliminates the variables b and c in (2) and reduces the three equations to a fourth-order algebraic equation
x 4 80 x 3 + 1998 x 2 14 , 937 x + 5000 = 0
where x = 2 a 2 . In the following we will use the term “Pell–Wallis equation” to refer to (5). To determine a root x * , Wallis uses Viète’s method and a is found through a = x * / 2 . To compute b, Wallis derives a cubic equation which follows from multiplying the first quadratic equation by a and the second by b and eliminates a b c to obtain the cubic equation
17 b b 3 = 16 a a 3 ,   where   a = 1 2 x * .
Having found a and b, the unknown c is found from the first quadratic a 2 + b c = 16 .
One of the most classical problems in mathematics is the solution of systems of polynomial equations in several unknowns [10]. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, machine learning, control theory, and numerous other areas [10]. Systems of quadratic polynomial equations appear in nearly every crypto-system [11] and in robotics [12].
For more than 250 years, the equation x 4 80 x 3 + 1998 x 2 14937 x + 5000 = 0 has played an important role in the development of new methods, analyses of algebraic equations, and comparisons of methods for solving nonlinear equations.
In Section 2 we discuss four different approaches in solving Colones Titus’ problem that have appeared in the literature and in Section 3 we discuss different techniques and methods using the Pell–Wallis Equation (5). For a modern treatment of numerical methods for roots of polynomials, see [13,14] and references therein. For solving systems of polynomial equations, see [10,11] and references therein.

2. Colonel Titus’ Problem

Using the notation in Wallis algebra book from 1685 [2], Ch. LX–LXI, the general Colonel Titus problem is as follows. For given positive real numbers l , m , and n, find a , b , and c such that
a 2 + b c = l ,
b 2 + a c = m ,   and
c 2 + a b = n .
We review several solution techniques, mainly using what could be described as high-school algebra [15]. An elegant solution is given in Solutions of the principal questions of Dr. Hutton’s course of mathematics by Thomas Stephens Davies, and we follow his solution technique.
From (6) and (7) we have
c = l a 2 b and c = m b 2 a .
Equating the two expressions for c, we have a cubic equation in b
b 3 m b + a ( l a 2 ) = 0 .
From (8) and the two expression for c above, we have
n a b = c 2 = l a 2 b m b 2 a
which is a quadratic equation in b
( l 2 a 2 ) b 2 + n a b + ( a 2 l ) m = 0 .
Multiply the quadratic equation by b and the cubic equation by l 2 a 2 and subtract the two expressions to eliminate the cubic term. We now have two quadratic equations in b
( l 2 a 2 ) b 2 + n a b + ( a 2 l ) m = 0 and n b 2 m a b + ( a 2 l ) ( l 2 a 2 ) = 0 .
To eliminate b 2 , multiply the first quadratic equation by n and the second by l 2 a 2 and subtract the two resulting quadratic equations. The result is a linear equation in b. Solve for b:
b = ( l a 2 ) ( m n ( l 2 a 2 ) 2 ) a ( n 2 + m ( l 2 a 2 ) ) .
Substitute the value for b in
n b m a = ( l a 2 ) ( m n 2 m 2 a 2 n ( l a 2 ) ( l 2 a 2 ) ) a ( n 2 + m ( l 2 a ) )
and
1 b ( a 2 l ) ( l 2 a 2 ) = n ( l a 2 ) ( l 2 a 2 ) 2 a ( n 2 + m ( l a a 2 ) ) ( l a 2 ) ( m n ( l 2 a 2 ) 2 ) .
Equate the two expressions in n b m a = ( l a 2 ) ( l 2 a 2 ) / b and simplify
8 a 8 20 l a 6 + ( 18 l 2 2 m n ) a 4 + ( 5 l m n 7 l 3 m 3 n 3 ) a 2 + ( l 2 m n ) 2 = 0 .
Multiply the equation by 2 and let x = 2 a 2 and we have the equation
x 4 5 l x 3 + ( 9 l 2 m n ) x 2 + ( 5 l m n 7 l 3 m 3 n 3 ) x + 2 ( l 2 m n ) 2 = 0 .
For each real root, x * of (9) a , b , and c, can be computed in the following way; a in 2 a 2 = x * , b in n b 2 m a b = ( l a 2 ) 2 a 2 ( l a ) , and c in a 2 + b c = l . For l = 16 , m = 17 , and n = 18 we have the equation
x 4 80 x 3 + 1998 x 2 14937 x + 5000 = 0
which is (5).
Different techniques for solving Colonel Titus’ problem have been suggested in the literature by philomaths and mathematicians, school teachers of mathematics, and professors of mathematics. The different solution techniques can mainly be divided in two groups; the first group is based on elimination and the second group on first reformulating the problem and then performing an elimination.
The first solution to Colonel Titus’ problem was published by J. Wallis [2] and this was an elimination of the unknowns that results in the quartic Equation (5). To find the four positive roots of (5) Wallis used a digit-by-digit computation method. The solution of Colonel Titus’ problem by Wallis was republished by Francis Maseres (1731–1824) in 1800, including numerous details ([16], pp. 187–239). However, Maseres did not use a digit-by-digit method to find the roots, but rather the Newton–Raphson method. Similar solutions using explicit elimination are found in [5,17,18,19], all leading to the same quartic Equation (5). J. Kirkby [20] in 1735 and A. Cayley [21] in 1860 used a general elimination theory, leading to the same quartic equation.
The method of introducing two new variables expressing the unknowns as a fraction of one of the other variable was studied by J. Ryley [9] in 1796, and made popular by William Frend [22] in 1800. Variations of this technique are found in [23,24,25]. Ivory expressed two of the unknowns as a difference of the third [26,27]. All these reformulations lead to quartic equations that are different from the quartic Equation (5). These quartic equations never reached the same popularity as (5).
Using iterative methods to solve the three equations simultaneously was suggested in the Diarian Repository [6] in 1774 and by Whitley [28] in 1824.

2.1. Ladies’ Diary 1725 Question 113

We find a variation of Colonel Titus’ problem in the journal Ladies’ Diary from 1725 in Question 113 shown in Figure 1 where l = 920 , m = 980 , and m = 1000 .
In Ladies’ Diary in 1726 John Turner (active in Ladies’ Diary from 1726 to 1750 ([17], p. 423)) gives a solution of the problem and states the equation (using the notation in Wallis)
8 a 8 20 l a 6 + ( 18 l 2 2 m n ) a 4 + ( 5 l m n 7 l 3 m 3 n 3 ) a 2 + l 4 2 l 2 m n + m 2 n 2 = 0 .
Let x = 2 u 2 and multiplying the equation by two gives (9). Turner gives the solution of Question 113 in Ladies’ Diary to be 19.5991 , 22.7788 , and 23.5276 . There are three minor typographical errors in the solution by Turner ([29], p. 7):
8 a 8 18 l a 6 + ( 18 l 2 + 2 m n ) a 4 + ( 5 l m n 7 l 3 m 3 n 3 m n ) a 2 + l 4 2 l 2 m n + m 2 n 2 = 0 .
These three typographical errors are repeated in Diarian Miscellany [7] and Diarian Repository [6] and one error is pointed out in the Errata of [8].
For l = 920 , m = 980 , and n = 1000 , the Equation (9) has four positive roots approximately equal to 1937.6, 1881.6, 768.0, and 12.7, and the only root that gives reasonable ages is 768.0, and the ages are approximately a = 19.5965 , b = 22.7799 , and c = 23.5286 .

2.2. A Renewed Interest in Colonel Titus’ Problem

In Diarian Repository by S. Clark [6], pp. 190–191 (Archibald [30] states that Samuel Clark was the editor of this repository) from 1774; Diarian Miscellany by C. Hutton from 1775 [7], pp. 266 and 271; and later in Leybourn’s four volume collection of questions in Ladies’ Diary from 1817 [8], pp. 145–146, we find Question 113 and the three Equations (6)–(8). The three repositories [6,7,8] all reproduce John Turner’s equation and solution (ages) but also give additional information or alternative solution techniques.
Leybourn also presents an additional solution of Colones Titus’ problem provided by Mark Noble (a mathematician at Royal Military College (Sandhurst)) in the appendix in the fourth volume [17], pp. 255–259. The contribution is signed N and in the preface of Leybourn’s first volume ([8], Preface page X) it is signed "this is Mark Noble".This is an elimination technique and it leads to the same quartic equation as in Wallis. Noble derives one cubic and one quadratic equation similar to the equations derived by Kirkby. Although Kirkby invokes a general elimination result from Newton ([31], p. 74), Noble carries out the elimination explicitly and obtains the Equation (9). Noble gives the roots of the polynomials and the different values of a , b , and c.

2.3. The Scientific Receptacle 1796 Question 209

The Scientific Receptacle published in 1796 the question shown in Figure 2 ([9], p. 77). The problem is find positive numbers (using the notation in Wallis) a , b , and c so that
a 2 + b c = 1 , 806 , 520 , b 2 + a c = 2 , 225 , 275 ,   a n d   c 2 + a b = 5 , 567 , 720
with a solution published in a later issue in the same volume ([9], p. 95).
Figure 2. Question 209 in The Scientific Receptacle from 1796 proposed by James Gale.
Figure 2. Question 209 in The Scientific Receptacle from 1796 proposed by James Gale.
Axioms 11 00287 g002
John Ryley (1747–1815) published the solution of the problem in 1796 [9]. Ryley considered the three Equations (6)–(8) and introduced two new variables x and y so that
b = x c and a = y c .
and derived the equation
( n 2 l m ) x 4 + ( m 2 + l n ) x 3 4 m n x 2 + ( n 2 + l m ) x + m 2 l n = 0 .
From a root of (11), all other quantities can be determined. However, Ryley does not compute any root of (11) or values of a , b , and c for the given l , m , and n.

2.4. First Reformulation and then Elimination

J. Ryley was the first to express two of the unknowns as a fraction of the third. W. Frend (1757–1841) ([22], pp. 240–246) in 1800 provided a different derivation and introduced x and y so that
b = x a and c = y a ,
and derived the equation
( m n l 2 ) x 4 ( l n + m 2 ) x 3 + 4 l m x 2 ( l 2 + m n ) x m 2 + l n = 0 .
A minor improvement of Frend’s solution, avoiding a square root, was given by John Hellins (c. 1749–1827) in the introduction of the same volume in which Frend’s solution was found [16], pp. lxxi–lxxii. By interchanging the variables, Equation (13) can be derived from (11).
For l = 16 , m = 17 , and n = 18 we obtain the equation
50 x 4 577 x 3 + 1088 x 2 562 x 1 = 0 .
The equation has four real solutions (or roots), of which one is negative. Maseres [16] (pp. 246–275) finds the three positive roots to be approximately 1.027179787, 1.17565, and 9.3388519 using Newton–Raphson iteration. Maseres regards the root 1.027179787 as “impossible” since y is negative. For a given root, y and the unknowns a, b, and c are easily found.
Maseres ends the tract with a comment that Mr. Frend’s solution has the advantage that it saves the trouble of those very tedious and perplexing algebraic multiplications and divisions necessary in Dr. Wallis’s solution [16], p. 275. A similar solution to Frend’s was given by Tebay [25] in 1845. A third variation is to express a and b in terms of c [23].
James Ivory (1765–1842) [26] wrote that the solution provided by Wallis to the problem (2) was remarkably operose and inellegant and a solution of the same problem by Frend [22] is preferable to Wallis’s solution. Ivory expressed two of the unknowns as a difference of the third and the analysis was printed in 1804 in [26], but with no numerical solution. Ivory restricts his analysis to the specific choice l = 16 , m = 17 , and n = 18 . Ivory’s analysis was mailed to Baron Maseres [27] p. 360 and Maseres added many details and a numerical solution based on the Newton–Raphson method [32].
Whitley [24], p. 121 wrote in 1824 that Mr. Ivory’s solution was an elegant specimen of analysis and Davis [18], p. 274 in 1840 called it an exceedingly elegant investigation. Cockle [3] speculated that the analysis can be carried over to the case where m = ( n + l ) / 2 . It can be shown that the derivation by Ivory can be extended to the general case of l , m , and n. Maseres [32], pp. 371–395 computed the two positive roots of the quartic equation derived by Ivory and these correspond to the positive a , b , and c values provided by Wallis.

2.5. Simultaneous Solution of the Three Unknowns

In the Repository Solution section in the Diarian Repository [6], pp. 190–191 an iterative approach was suggested. First, find an approximate solution (in this case 23, 22.5, and 21.1); then, find a correction ( x , y , and z) that solves the (linear) equations where the second order terms are eliminated. …then via the solution of the resulting equations, x, y, and z will be determined to a sufficient degree of exactness; if not, the operation must be again repeated with the last found values… [6], pp. 190–191. This is Newton’s method but no actual computations of a , b , and c are shown, except for finding the starting point for the iteration.
J. H. Swales, the editor of the Liverpool Apollonius asked its readers in 1823 to find a simpler solution than those given by Ivory [26], p. 156 and Frend [22], p. 240. Three traditional solutions were submitted by J. Whitley, Settle, and S. Ryley and a completely new approach using a fixed-point iteration method by Whitley was published in the next volume. In 1853, T. T. Wilkinson, in his series of articles on the History of Mathematical Periodicals wrote in relation to the Liverpool Apollonius (In Mechanics Magazine, Volume 58, 1853 p. 307) that the iterative method used by Whitley was one of the neatest and most effective methods of solving Colonel Titus’ problem. The same appraisal was provided in 1865 in the Educational Times (Educational Times p. 270, 1865 on Question 113 from the Ladies’ Diary).
The method proposed by Whitley [28], pp. 127–128 in 1824 is the fixed-point iteration
a k + 1 b k + 1 c k + 1 = l b k c k m a k c k n a k b k k 0
with the starting point given by a 0 = b 0 = c 0 = 3 , where l = 16 , m = 17 , and n = 18 . Table 1 compares the fixed-point iteration to Newton’s method for F ( a , b , c ) ( a 2 + b c 16 , b 2 + a c 17 , c 2 + a b 18 ) = ( 0 , 0 , 0 ) with the starting point ( a 0 , b 0 , c 0 ) = ( 3 , 3 , 3 ) .
Arthur Cayley (1821–1895) considered Colonel Titus’ problem and suggested that if a = x z and b = y z the equations become
x 2 + c y z l z 2 = 0 y 2 + c z x m z 2 = 0 ( c 2 n ) z 2 + x y = 0
which are three homogeneous equations of second order in three unknowns [21]. However, Cayley did not solve the homogeneous equations. Schumacher solved this problem [33] in 1911.

2.6. Erroneous Solution

The achievements of Adrien Quentin Buée (1748–1825), also called Abbé Buée, are important in relation to the conceptual development of the negative numbers and for the graphical representation of the complex numbers. In [34], he considers Colonel Titus’ problem and makes an attempt to solve it using geometry and complex numbers. He claims that the solution must be a = 3.25 x , b = 4.25 x , and c = 5.25 x , where x is the area of a circle in the geometric construction. However, he does not find any correct solution to the problem.

3. The Pell–Wallis Equation

In the late 17th and early 18th centuries, there were numerous collections of algebraic equations [35]. Most practical algebraic equations were derived from geometric or trigonometric problems. An algebra book by John Ward from 1695 contains ten geometric problems with corresponding algebraic equations [36] and The Young Mathematician’s guide from 1707 contains more than 20 practical problems from geometry and trigonometry, leading to algebraic equations [37]. However, The Pell–Wallis equation is derived from a different type of problem. The equation has been in use for 270 years, from the first time it appeared in print in 1685 to the most recent reference to the equation in a paper from 1955.

3.1. Digit-by-Digit Methods

The root finding method used by Wallis in 1685 was a digit-by-digit computation method [2]. The method used by Wallis was based on Vietè’s method but it deviated from Vietè’s method in the divisor used to compute the next digit [38]. In this method, the roots are computed with a very high degree of accuracy. With Horner’s technique to compute shifted polynomials, the digit-by-digit approach became more efficient using Holdred’s and Horner’s divisor [38]. The Pell–Wallis equation is used as an example in Holdred [39], pp. 55–56 and Nicholson [40], pp. 74–76, 80–82 in 1820 and [41], p. 19; de Morgan [42], pp. 50–51 in 1839; Perkins [43], pp. 356–358 and Young [44], pp. 213–221 in 1842; Lobatto [45], pp. 114–166 in 1845; Schnuse [46], pp. 212–216 in 1850; and Onley [47], pp. 240–245 in 1878—all using digit-by-digit computation.

3.2. Bracketing Methods

In Vietè’s method, the first digit of a root must be specified. This will normally lead to the determination of the intervals of the roots. Intervals of the real roots may also provide a starting point for linear interpolation. Cardano’s golden rule and regula falsi are methods in which a root is bracketed. Application of the Newton–Raphson method and the Halley method, which are iterative methods, requires a starting point sufficiently close to a root/solution and this point is often determined to be in an interval including the root.
The Pell–Wallis equation has been used as an example in [48], p. 335, Kirkby [20] Part IV, pp. 32–34 in 1735; Frend [49], pp. 109–111 and [50] pp. 298–299 in 1799 and 1800. A more systematic approach was employed with the application of Sturm’s theorem in [51] from 1839 and Young [52], pp. 159–161 in 1841. This method was also used by Siebel in 1880 and 1887 [53], pp. 406–407 [54], pp. 337–338 in an ad hoc way.

3.3. Linear Interpolation

The first use of the Pell–Wallis equation and interpolation occurred in 1732. Graaf [55], pp. 33–35 considered (5) and scaled the variable x x / 10 in the interval of 0 to 3.6 and plotted the graph ( x , f ( x ) ) , where f ( x ) is the left-hand side of (5). Based on the graph, an interval where a solution exists was identified, and then linear interpolation. This is a variation of regula falsi [56] and Cardano’s regula aurea [57], Chapter 30 methods, since both end points of the interval are changed in de Graaf’s approach.
The method of John Davidson, a teacher in mathematics in Burntisland, involves a bracketing approach and linear interpolation [58], p. 114, [59], p. 38, as shown in his textbooks from 1814 and 1852. This is Cardano’s golden rule [57], Chapter 30.

3.4. The Newton–Raphson Method

Wallis published his algebra book in 1685 [2] and it contained the first printed version of Newton’s method. When Raphson presented his method in 1690 it was regarded as a different method. It was not until the mid-18th century that it became clear that the two methods generated the same sequence of iterations [35]. From a computational point of view, the methods are very different. Raphson demonstrated his method on 32 examples and the Pell–Wallis equation was given as example 21 [60] Problem XXI. Kirby [20], Part IV, pp. 35, 44–45 in 1735 used the Newton–Raphson method to find one of the roots of the Pell–Wallis equation.
In Volume III of Scriptores logarithmici from 1796, Francis Maseres used the Newton–Raphson method. First an approximation 0.3507 to the smallest root is found by using a series expansion and then two iterations are performed [61], pp. 718–725. Maseres writes "…and this I take to be the very best method that can be employed to find the value of x to this degree of exactness".
Lockhart [62] in 1839 argues that the numbers of digits required to compute an approximate solution using the Newton–Raphson method is not worse than Horner’s digit-by-digit method, as presented by De Morgan [42] in 1839.

3.5. Halley’s Method

Edmund Halley (1656–1742), in a paper from 1694, derived two methods, the rational and irrational method [63]. Halley pointed out that the Pell–Wallis Equation (5) was solved by Wallis using the method of Vieté and solved by Raphson using the Newton–Raphson method. Halley applied both methods to the Pell–Wallis equation. For the irrational method, two possible corrections can be used before the new iteration.
In 1710, Christian Wolff (1679–1754) provided a different derivation of Halley’s irrational method and redid the computation method developed by Halley using the irrational method and the correction to find the largest root of (5) [64], pp. 192–194.
Philip Ronyane (1683–1755) applied Halley’s rational and irrational methods. With the irrational method he use the two corrections used by Halley and gave a derivation of the corrections, whereas Halley has just stated them [65], pp. 242–244.
One of the earliest professors in mathematics in an American college was Isaac Greenwood (1702–1745) and two notebooks from his students—Samuel Langdon (1723–1797), who graduated from Harvard in 1740, and James Diman (1707–1788), who graduated in 1730—have been kept [66], ([67], pp. 3–17). A topic in the Diman notebook from 1730 is “Dr. Halley’s theorems for solving equations of all sorts” and here we find (reproduced in [66], p. 64) three iterations with Halley’s rational method on (5).

3.6. Ferrari–Cardano Approach

The linear shift x 20 in the Pell–Wallis equation makes the term x 3 vanish and the depressed quartic equation is
x 4 402 x 2 + 983 x + 25 , 460 = 0 .
Taking two slightly different approaches, Francis Maseres first finds the depressed quartic (14) and then, with reference to Ferrari, finds the resolvent cubic
v 3 201 v 2 25460 v 967 , 897 8 = 0 ,
and, with reference to Descartes [68], p. 142, the resolvent cubic (in e 2 ) is
e 6 804 u 4 + 59764 e 2 966 , 289 = 0 .
The four roots of the Pell–Wallis equation can then found [68], pp. 134–182. Maseres points out that the use of linear interpolation and one iteration with Newton–Raphson will require fewer arithmetic operations than the use of Ferrari-Cardano approach [68] p. 178.
William Rutherford (1798–1871) found the depressed quartic (14) and then derived the resolvent cubic equation (in u 2 )
u 6 402 2 u 4 + 59 , 764 16 u 2 966 , 289 64 = 0 .
From the resolvent cubic (17), using Horner’s method, Rutherford found one root and the four roots of the Pell–Wallis equation [69], pp. 17–18.
Orson Pratt (1811–1881) [70], pp. 130–131 used the depressed quartic (14) and derived the resolvent depressed cubic
y 3 1 , 401 , 372 y 633 , 074 , 427 = 0 .
A root of the depressed cubic is found using a digit-by-digit approach with a modified divisor in Vietè’s method, to eleven decimal places, and then the roots of the Pell–Wallis equation are given.
Christian Heinrich Schnuse (1800–1878) considered the Pell–Wallis equation and derived the depressed quartic (14) and the resolvent cubic (17). Using a digit-by-digit approach, he found the same root of (17) as Rutherford in 1849 [46], pp. 358–359.

3.7. Gräffe’s Method

D. Miguel Merino (1831–1905) translated and revised a work by Johann Franz Encke (1791–1865) [71] on the numerical solution of equations. Using Gräffe’s method and one final Newton–Raphson iteration, the four roots are found [71], pp. 42–44. In Gräffe’s method a sequence of polynomials is generated and the method is a “root-squaring” process and approximations to the roots can be computed from the coefficients of of the generated polynomials. The method works well for the Pell–Wallis equation since the roots are real, positive, and separated. The method is suitable for computation by hand, whereas computer implementations usually exhibit overflow after only a few steps. After a few steps, the estimates of the roots are good and suitable for a correction by means of Newton–Raphson iterations. The two smallest roots are correct with four decimal digits after four steps in Gräffe’s method. Given that the two smallest roots have been accurately computed, the remaining two roots can be computed [72], pp. 74–75. Encke in 1839, Merino in 1879, and Rey Pastor [72] (1888–1962) in 1924 found it more convenient to work with the log of the coefficients of the polynomials.

3.8. Miscellaneous Methods and Comments

  • Wells pointed out in 1698 that the Pell–Wallis equation was solved by Raphson, Halley, and Wallis using the Newton–Raphson method, Halley’s methods, and Vietè’s method [73], pp. 213–214.
  • In 1716 [74], pp. 138–139, Struyck translated Halley’s papers from 1694 into Dutch (French translation in 1912 [75], pp. 148–149).
  • In the 4th edition of the Theory of Equations [76], pp. 269–270 from 1899, Burnside and Panton derived the resolvent cubic (16). They also showed that the roots are real [76], p. 194 and if two of the roots are known, the two remaining roots can easily be found [76], p. 267.
  • With reference to [72] (pp. 74–75) for the Pell–Wallis equation Carlos Calvo Carbonell [77] derived the depressed quartic (14) and scaled the variable 402 x and obtained the equation
    x 4 x 2 + 983 402 3 x + 25 , 460 402 2 = 0 .
    By graphical inspection, the roots of (18) are located in intervals of length 0.01.For a point in the interval, a first correction method is a Newton-Raphson iteration, then a correction based on the next term in the Taylor expansion. The four roots are computed using two or three corrections.
  • Silvestre François Lacroix (1765–1843) [78], p. 261 discussed the Pell–Wallis equation as a problem of scaling the coefficients and found that the two roots are between 0 and 10 and 10 and 20.
  • Preston Albert Lambert (1862–1925), in 1903, used the Pell–Wallis equation to find the depressed fourth-order polynomial (14) and applied Maclaurin expansion to find an approximate solution [79], p. 92.
  • Leonard Eugene Dickson (1874–1954), in his book on Elementary theory of Equations from 1914, used the Pell-Wallis equation as a problem. He first found two approximate roots r and s and then the next two roots r 1 and r 2 by solving using expressions for r 1 + r 2 and r 1 r 2 as functions of r and s [80], p. 121.
  • We find numerous examples of the use of the Pell–Wallis equation as an exercise or problem in the second half of the 19th century: [81], p. 218, [82], p. 116, [83], p. 350, [84], p. 14, [85] p. 358, [86], pp. 352–353, [87], p. 170, and [88], p. 307.

3.9. An Early Comparison of Four Algorithms on Three Examples

One of the first comparisons of the use of several algorithms on different problems is found in [16]. The methods used were Newton–Raphson, Halley’s two methods, and regula falsi or linear interpolation. The latter method is called the the differential method in [16] or the method of double position. Maseres [16] p. 109 provides a reference to A Course of Mathematics in Two Volumes, Composed for the Use of the Royal Military Academy by Charles Hutton for the equivalence between the differential method and the method of double position.
The three equations tested were x 3 17 x 2 + 54 x 350 = 0 , x 4 3 x 2 + 75 x 10 , 000 = 0 , and the Pell–Wallis equation x 4 + 80 x 3 1998 x 2 + 14 , 937 x 5000 = 0 . These three examples are from Halley [63].

4. Concluding Remarks

We have shown that the three quadratic equations in three unknowns forming Colonel Titus’ problem can be reduced to a single quartic equation using standard high school algebra. The different derivations of a quartic equation have been suggested by philomaths and mathematicians, school teachers of mathematics, and professors of mathematics over a period ranging from the mid-17th to the early 20th century. We find systems of quadratic equations in modern crypto-systems or robotics. Today, solutions can easily be obtained through the use of computer algebra systems implemented in Maple, Mathematica, or Wolfram. The modern theory related to solution methods, such as the use of a Gröbner basis, has not yet been explored in relation to Colonel Titus’ problem.
We have seen that the quartic equation, the Pell–Wallis Equation (5), derived from Colonel Titus’ problem, has been used for more than 250 years as a test example to develop methods to solve algebraic equations, techniques to determine the number of roots, or intervals of the roots, as well as in numerous textbooks. As a well-known equation, it has been included in the early numerical comparisons of root finding methods.
The references in this paper do not form a complete list of the use of this equation and Colonel Titus’ problem.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Stedall, J.A. Tracing mathematical networks in seventeenth-century England. In The Oxford Handbook of the History of Mathematics; Robson, E., Stedall, J., Eds.; Oxford University Press: Oxford, UK, 2009; pp. 133–151. [Google Scholar]
  2. Wallis, J. A Treatise of Algebra, Both Historical and Practical; Richard Davis: London, UK, 1685. [Google Scholar] [CrossRef]
  3. Cockle, J. Horæ algebraicæ, XI Quadratic equations. Mech. Mag. 1849, 50, 33–36. [Google Scholar]
  4. Bonnycastle, J. Treatise on Algebra, in Practice and Theory, with Notes and Illustrations, 2nd ed.; J. Nunn: London, UK, 1820; Volume 1. [Google Scholar]
  5. Williams, J.D. An Elementary Treatise on Algebra, in Theory and Practice; Hilliard, Gray & Co: Boston, MA, USA, 1840. [Google Scholar]
  6. Anonymous. The Diarian Repository; or, Mathematical Register: Containing a Complete Collection of All the Mathematical Questions Which Have Been Published in the Ladies Diary, from the Commencement of that Work in 1704, to the Year 1760; Together with Their Solutions Fully Investigated, According to the Latest Improvements. The Whole Designed as an Easy and Familiar Praxis for Young Students in Mathematical and Philosophical Learning by A Society of Mathematicians; G. Robinson: London, UK, 1774. [Google Scholar]
  7. Hutton, C. The Diarian Miscellany: Consisting of All the Useful and Entertaining Parts, Both Mathematical and Poetical, Extracted from the Ladies’ Diary, from the Beginning of that Work in the Year 1704, Down to the End of the Year 1773. With Many Additional Solutions and Improvements; Vol. I, G. Robinson and R. Baldwin: London, UK, 1775. [Google Scholar]
  8. Leybourn, T. The Mathematical Questions, Proposed in the Ladies’ Diary; Vol. I, J. Mawman: London, UK, 1817. [Google Scholar]
  9. Whiting, T. The Scientific Receptacle; Printed by W. Kemmish: London, UK, 1796. [Google Scholar]
  10. Sturmfels, B. Solving Systems of Polynomial Equations; American Mathematical Society: Providence, RI, USA, 2002. [Google Scholar]
  11. Ding, J.; Petzoldt, A.; Schmidt, D.S. Solving Polynomial Systems. In Multivariate Public Key Cryptosystems; Springer: New York, NY, USA, 2020; pp. 185–248. [Google Scholar] [CrossRef]
  12. Cox, D.A.; Little, J.; O’Shea, D. Robotics and Automatic Geometric Theorem Proving. In Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra; Springer International Publishing: Cham, Switzerland, 2015; pp. 291–343. [Google Scholar] [CrossRef]
  13. McNamee, J.M. Numerical Methods for Roots of Polynomials—Part I; Elsevier Science: Amsterdam, The Netherlands, 2007. [Google Scholar]
  14. McNamee, J.M.; Pan, V.Y. Numerical Methods for Roots of Polynomials—Part II; Elsevier Science: Amsterdam, The Netherlands, 2013. [Google Scholar]
  15. Abhyankar, S.S. Historical ramblings in algebraic geometry and related algebra. Am. Math. Mon. 1976, 83, 409–448. [Google Scholar] [CrossRef]
  16. Maseres, F. (Ed.) Tracts on the Resolution of Affected Algebraic Equations by Dr. Halley’s, Mr. Raphson’s and Sir Isaac Newton’s Methods of Approximation; Printed by J.Davis and sold by J. White: London, UK, 1800. [Google Scholar]
  17. Leybourn, T. The Mathematical Questions, Proposed in the Ladies’ Diary; Vol. IV, J. Mawman: London, UK, 1817. [Google Scholar]
  18. Davies, T.S. Solutions of the Principal Questions of Dr. Hutton’s Course of Mathematics; Printed for Longman, Orme, & Co: London, UK, 1840. [Google Scholar]
  19. Peacock, A. Brief solution of a celebrated algebraic problem. Mech. Mag. 1843, 39, 295–297. [Google Scholar]
  20. Kirkby, J. Arithmetical Institutions Containing a Compleat System of Arithmetic, Natural, Logarithmical, and Algebraical in All Their Branches; B.Motte and C.Bathurst: London, UK, 1735. [Google Scholar]
  21. Cayley, A. On a system of algebraic equations. Philos. Mag. J. Sci. 1860, 20, 341–342. [Google Scholar] [CrossRef]
  22. Frend, W. Another solution of Colonel Titus’s problem. In Tracts on the Resolution of Affected Algebraic Equations; Maseres, F., Ed.; Printed by J.Davis and sold by J. White: London, UK, 1800; pp. 240–275. [Google Scholar]
  23. Settle, W. Second solution to Problem IV. The Liverpool Apollonius, or the geometrical and philosophical repository 1824, 1, 121. [Google Scholar]
  24. Whitley, J. Colonel Titus’ problem, Problem IV. The Liverpool Apollonius, or the geometrical and philosophical repository 1824, 1, 120–121. [Google Scholar]
  25. Tebay, S. Question 22. Preston Chronicle, No.1705, 3 May 1845 1845, p. 3. [Google Scholar]
  26. Ivory, J. Article XVI. Solution to Colonel Titus’s arithmetical problem. In The Mathematical Repository; Leybourn, T., Ed.; W. Glendinning: London, UK, 1804; Volume III, pp. 156–159. [Google Scholar]
  27. Ivory, J. A new solution of Colonel Titus’s arithmetical problem. In Scriptores Logarithmici; Or a Collection of Several Curious Tracts; Maseres, F., Ed.; Printed by R.Wilks and sold by J. White: London, UK, 1807; Volume VI, pp. 360–370. [Google Scholar] [CrossRef]
  28. Whitley, J. A new and commodius method of solving Colonel Titus, and others of a similar kind. The Liverpool Apollonius, or the geometrical and philosophical repository 1824, 1, 127–128. [Google Scholar]
  29. Beighton, H. (Ed.) The Ladies’ Diary Or Woman’s Almanack, for the Year of Our Lord 1726; Printed by A. Wilde, for the Company of Stationers: London, UK, 1726. [Google Scholar]
  30. Archibald, R.C. Notes on Some Minor English Mathematical Serials. Math. Gaz. 1929, 14, 379–400. [Google Scholar] [CrossRef]
  31. Newton, I. Arithmetica Universalis; Sive de Compositione et Resolutione Arithmetica Liber; Printed by Benj. Tooke: London, UK, 1707; Edited by William Whiston. [Google Scholar]
  32. Maseres, F. The resolution of the biquadratic equation 34z + 5z2 − 34z3z4 = 8. In Scriptores Logarithmici; Or a Collection of Several Curious Tracts; Maseres, F., Ed.; Printed by R.Wilks and sold by J. White: London, UK, 1807; Volume VI, pp. 370–395. [Google Scholar] [CrossRef]
  33. Schumacher, J. Das Colonel Titus’s Problem. Archiv der Mathematik und Physik 1911, Series 3, 141–154. [Google Scholar]
  34. Buée, A. Solution of a problem of Col. Silas Titus. Ann. Philos. 1815, V, 53–61. [Google Scholar]
  35. Steihaug, T. Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745. Numer. Algorithms 2020, 83, 1259–1275. [Google Scholar] [CrossRef]
  36. Ward, J. A Compendium of Algebra; Author & by him sold: London, UK, 1695. [Google Scholar]
  37. Ward, J. The Young Mathematician’s Guide. Being a Plain and Easie Introduction to the Mathematicks; John Taylor: London, UK, 1707. [Google Scholar]
  38. Steihaug, T. Computational Science in the 17th Century. Numerical Solution of Algebraic Equations: Digit–by–Digit Computation. In Numerical Analysis and Optimization, NAO-V, Muscat, Oman, January 2020; Al-Baali, M., Purnama, A., Grandinetti, L., Eds.; Springer Nature: Berlin, Germany, 2021; chapter 12; pp. 249–269. [Google Scholar] [CrossRef]
  39. Holdred, T. A New Method of Solving Equations with Ease and Expedition; by which the True Value of the Unknown Quantity is Found without Previous Reduction. With a Supplement, Containing Two Other Methods of Solving Equations, Derived from the Same Principle; Printed by Richard Watts: London, UK, 1820. [Google Scholar]
  40. Nicholson, P. Essay on Involution and Evolution Particularly Applied to the Operation of Extracting the Roots of Equations and Numbers; According to a Process Entirely Arithmetical. A New Edition; Davis and Dickson: London, UK, 1820. [Google Scholar]
  41. Nicholson, P. Analytical and Arithmetical Essays; Davis and Dickson: London, UK, 1821. [Google Scholar]
  42. De Morgan, A. Notices of the progress of the problem of evolution. The Companion to the Almanac 1839, pp. 34–52. [Google Scholar]
  43. Perkins, G.R. A Treatise on Algebra: Embracing, Besides the Elementary Principles, All the Higher Parts Usually Taught in Colleges: Containing Moreover, the New Method of Cubic and Higher Equations, as well as the Development and Application of the More Recently Discovered Theorem of Sturm; O.Hutchinson: Utica, NY, USA, 1842. [Google Scholar]
  44. Young, J.R. The Analysis and Solution of Cubic and Biquadratic Equations; Souter and Law: London, UK, 1842. [Google Scholar]
  45. Lobatto, R. (Ed.) Lessen over de Hoogere Algebra; Gebroeders Van Cleef: Amsterdam, The Netherlands, 1845. [Google Scholar]
  46. Schnuse, C.H. Die Theorie und Auflösung der höhern algebraischen und der transcendenten Gleichungen; Eduard Leibrock: Braunschweig, Germany, 1850. [Google Scholar] [CrossRef]
  47. Olney, E. A University Algebra; Sheldon & Co: New York, NY, USA, 1878. [Google Scholar]
  48. Reyneau, C.R. Analyse démontrée, ou la Méthode de résoudre les problèmes des mathématiques, Tome I; Paris, chez Jacque Quillau, 1708. [Google Scholar]
  49. Frend, W. The Principles of Algebra or the True Theory of Equations Etablished on the Principles of Mathematical Demonstration. Part the second; G.G. and J. Robinson: London, UK, 1799. [Google Scholar]
  50. Frend, W. Article XXXV. Method of discovering the number of negative and impossible roots, in any equation. In The Mathematical Repository; Leybourn, T., Ed.; W. Glendinning: London, UK, 1801; Volume II, pp. 297–300. [Google Scholar]
  51. Lockhart, J. Extension of the Celebrated Theorem of C. Sturm, whereby the Roots of Numeral Equations may be Separated from Each Other, with Copious Examples; D.A.Talboys: Oxford, UK, 1839. [Google Scholar]
  52. Young, J.R. Mathematical Dissertations for the Use of Students in the Modern Analysis; John Souter: London, UK, 1841. [Google Scholar]
  53. Siebel, A. Untersuchungen über algebraische gleichungen. Archiv der Mathematik und Physik 1880, 56, 394–419. [Google Scholar]
  54. Siebel, A. Exacte Trennung der reellen Wurzeln numerischer algebraischen und transcendenten Gleichungen. Archiv der Mathematik und Physik 1887, Series 2, 279–349. [Google Scholar]
  55. de Graaf, I. Analysis Aequationum Algebraïcarum, of Algemeene Ontbinding der Bepaalde Stelkonstige Vergelykingen van drie, vier, vyf, ses en meer Afmetingen; Loots: Amsterdam, The Netherlands, 1732. [Google Scholar]
  56. Papakonstantinou, J.M.; Tapia, R.A. Origin and Evolution of the Secant Method in One Dimension. Am. Math. Mon. 2013, 120, 500–518. [Google Scholar] [CrossRef] [Green Version]
  57. Cardano, G. Artis Magnae, Sive de Regulis Algebraicis; Nuremberg, Germany, 1545. Ioh Petreius. English translation by T. Richard Witmer, The Rules of Algebra (Ars Magna), Cambridge, MA: MIT Press, 1968; reprinted as G. Cardano, Ars Magna or The Rules of Algebra, Garden City, NY: Dover Publications; 1993. [Google Scholar]
  58. Davidson, J. Supplement to the Practical Calculator; Andrew Balfour: Edinburgh, UK, 1814. [Google Scholar]
  59. Davidson, J. Key to Davidson’s System of Practical Mathematics: Containing Solutions to All the Exercises in that Work; Bell & Bradfute: Edinburgh, UK, 1852. [Google Scholar]
  60. Raphson, J. Analysis Æquationum Universalis, seu ad Æquationes Algebraicas Resolvendas Methodus Generalis, et Expedita, Ex nova Infinitarum serierum Doctrina, Deducta ac Demonstrata; Sold by Abel Swalle: London, UK, 1690. [Google Scholar]
  61. Maseres, F. Scriptores Logarithmici; Or a Collection of Several Curious Tracts; Vol. III, J. Davis: London, UK, 1796. [Google Scholar]
  62. Lockhart, J. Resolution of Two Equations. Being a Homage to the Memory of the Founders and Benefactors of the University of Oxford, at the Commemoration Held on the 12th of June, 1839; D.A.Talboys: Oxford, UK, 1839. [Google Scholar]
  63. Halley, E. Methodus Nova Accurata et Facilis Inveniendi Radices Æquationum Quarumcumque Generaliter, Sine Prævia Reductione. Philos. Trans. (1683–1775) 1694, 18, 136–148. [Google Scholar] [CrossRef] [Green Version]
  64. Wolff, C. Der Anfangs-Gründe Aller Mathematischen Wiessenschaften. Letzter Theil. Welcher so wol die gemeine Algebra, als die Differential- und Integral-Rechnung, und einen Anhang Von den vornehmsten Mathematischen-Schrieften In sich begreifet; Renger: Halle Magdeburgischen, Germany, 1710. [Google Scholar]
  65. Ronayne, P. A Treatise of Algebra in Two Books: The First Treating of the Arithmetical and the Second of the Geometrical Part; Printed for W. Innys: London, UK, 1717. [Google Scholar]
  66. Simons, L.G. Algebra at Harvard College in 1730. Am. Math. Mon. 1925, 32, 63–70. [Google Scholar] [CrossRef]
  67. Simons, L.G. Introduction of Algebra into Ameriçan Schools in the Eighteenth Century; Department of the interior, Bureau of education Bulletin No.18: Washington, DC, USA, 1924. [Google Scholar]
  68. Maseres, F. Tracts on the Resolution of Cubick & Biquadratick Equations; Wilks and Taylor: London, UK, 1803. [Google Scholar]
  69. Rutherford, W. The Complete Solution of Numerical Equations: In Which, by One Uniform Process, the Imaginary as Well as the Real Roots are Easily Determined; G. Bell: London, UK, 1849. [Google Scholar]
  70. Pratt, O. New and Easy Method of Solution of the Cubic and Biquadratic Equations; Longmans, Green, Reader, and Dyer: London, UK, 1866. [Google Scholar]
  71. Encke, J.F. Resolucion general de las escuaciones numéricas por el método de Gräffe. Translated and revised by D. Miguel Merino of Allgemeine Auflösung der numerischen Gleichungen; E. Aguado: Madrid, Spain, 1879. [Google Scholar]
  72. Rey Pastor, J. Lecciones de álgebra, 2nd ed.; Notes from a course in 1915–1916: Madrid, Spain, 1924. [Google Scholar]
  73. Wells, E. Elementa Arithmeticae Numerosae Et Speciosae; Printed by Johan Croke: Oxford, UK, 1698. [Google Scholar]
  74. Struyck, N. Uytreekening der kansen in het speelen, door de arithematica en algebra, beneevens een verhandeling voor looteryen en interest; Salomon Schouten: Amsterdam, The Nederlands, 1716. [Google Scholar]
  75. Struyck, N. Les oeuvres de Nicolas Struyck, 1687–1769. qui se rapportent au calcul des chances, à la statistique générale, à la statistique des décès et aux rentes viagères tirées des oeuvres complètes. Traduites du hollandais par J.A. Vollgraff; Algemeene maatschappij van levensverzekering en lijfrente: Amsterdam, The Netherlands, 1912. [Google Scholar]
  76. Burnside, W.S.; Panton, A.W. The Theory of Equations: With an Introduction to the Theory of Binary Algebraic Forms, Vol 1; Dublin University Press series, Hodges, Figgis, & Co: Dublin, Ireland, 1899. [Google Scholar]
  77. Calvo Carbonell, C. Estudios sobre la resolución numérica de ecuaciones de 3.º, 4.º, y 5.º grado. Gaceta Matemática 1955, 5–6, 109–124. [Google Scholar]
  78. Lacroix, S.F. Élemens d’algèbre; Crapelet-Duprat: Paris, France, 1799. [Google Scholar]
  79. Lambert, P. New applications of Maclaurin’s series in the solution of equations and in the expansion of functions. Proc. Am. Philos. Soc. 1903, 42, 85–95. [Google Scholar]
  80. Dickson, L.E. Elementary theory of equations; John Wiley & sons: New York, USA, 1914. [Google Scholar]
  81. Bonnycastle, J. The Elements of Algebra with Many Useful and Important Additions, Adapted to the System of Instruction Pursued in the Universities and Military Colleges, by William Galbraith and William Rutherford; Maclachlan, Stedwart & Com: Edinburgh, UK, 1848. [Google Scholar]
  82. Chambers, W.; Chambers, R. Exercises and Problems in Algebra with Answers and Hints to the Solutions; W. and R. Chambers: London, UK, 1855. [Google Scholar]
  83. Day, J. An Introduction to Algebra: Being the First Part of A Course of Mathematics, Adapted to the Method of Instruction in the American Colleges; Durrie & Peck: New Haven, CT, USA, 1857. [Google Scholar]
  84. Pimentel, M.H. Verzameling van vraagstukken en toepassingen over de hoogere algebra; ’S Gravenhage: The Hague, The Netherlands, 1858. [Google Scholar]
  85. Heis, E. Sammlung von Beispielen und Aufgaben aus der allgemeinen Arithmetik und Algebra; M. DuMont: Koeln, Germany, 1868. [Google Scholar]
  86. Matthiessen, L. Schlüssel zur Sammlung von Beispielen und Aufgaben aus der allgemeinen Arithmetik und Algebra, 2nd ed.; Vol. 2, M. DuMont-Schauberg: Koeln, Germany, 1878. [Google Scholar]
  87. Burnside, W.S.; Panton, A.W. The Theory of Equations: With an Introduction to the Theory of Binary Algebraic Forms; Dublin University Press series, Hodges, Figgis & Company: Dublin, Ireland, 1881. [Google Scholar]
  88. Taylor, J.M. A College Algebra, 6th ed.; Allyn & Bacon: Boston, MA, USA; Chicago, IL, USA, 1889. [Google Scholar]
Figure 1. Question 113, proposed by Thomas Grant in Ladies Diary from 1725, taken from Charles Hutton 1775 [7], p. 266. In the collection by Leybourn from 1817, the question is slightly rephrased [8], p. 145.
Figure 1. Question 113, proposed by Thomas Grant in Ladies Diary from 1725, taken from Charles Hutton 1775 [7], p. 266. In the collection by Leybourn from 1817, the question is slightly rephrased [8], p. 145.
Axioms 11 00287 g001
Table 1. Fixed-point iterations of Whitley and Newton’s method.
Table 1. Fixed-point iterations of Whitley and Newton’s method.
Whitley
k a k b k c k
12.64583.01043.1678
22.54232.99103.2242
32.52112.97853.2390
42.52052.97263.2415
52.52272.97033.2414
Newton
k a k b k c k
12.58332.91673.2500
22.52632.96983.2395
32.52552.96923.2406
42.52552.96923.2406
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Steihaug, T. A Story of Computational Science: Colonel Titus’ Problem from the 17th Century. Axioms 2022, 11, 287. https://doi.org/10.3390/axioms11060287

AMA Style

Steihaug T. A Story of Computational Science: Colonel Titus’ Problem from the 17th Century. Axioms. 2022; 11(6):287. https://doi.org/10.3390/axioms11060287

Chicago/Turabian Style

Steihaug, Trond. 2022. "A Story of Computational Science: Colonel Titus’ Problem from the 17th Century" Axioms 11, no. 6: 287. https://doi.org/10.3390/axioms11060287

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop