Hostname: page-component-848d4c4894-8kt4b Total loading time: 0 Render date: 2024-06-16T19:47:04.238Z Has data issue: false hasContentIssue false
  • English
  • Français

Digging for roots using the Pascal spade

Published online by Cambridge University Press:  23 January 2015

Shailesh A. Shirali
Shailesh A. Shirali*
Affiliation:
Community Mathematics Centre, Rishi Valley School (KFI), Rishi Valley 517 352, A.P., India, e-mail:shailesh.shirali@gmail.com
Get access Rights & Permissions [Opens in a new window]

Extract

Here is a result which will surely make one sit up. We start with a sequence t1 = (1, 1, 2, 2, 4, 4, 8, 8, 16, 16, … ) in which each power of 2 occurs twice in succession, and produce a second sequence whose n th term is the sum of the n th and (n + 1) th terms of the original one; we get the sequence t2 = (2, 3, 4, 6, 8, 12, 16, 24, 32, … ). We repeat the same operation on the resulting sequence, and continue this, iteratively. Here are the sequences t3, t4, t5:

t3 = (5, 7, 10, 14, 20, 28, 40, 56, 80, 1l2, 160, 224, 320, 448,…),

t4 = (12, 17, 24, 34, 48, 68, 96, 136, 192, 272, 384, 544, 768,…),

t5 = (29,41, 58, 82, 116, 164,232, 328, 464, 656, 928, 1312,…).

If we compute the ratio of the second term to the first term for each ti, we get the following sequence of rational numbers,

which converges to the square root of 2. (These fractions turn out to be successive convergents to the simple continued fraction for √2; see Section IV for details.)

Type
Articles
Information
The Mathematical Gazette , Volume 96 , Issue 536 , July 2012 , pp. 251 - 260
Copyright
Copyright © The Mathematical Association 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Giberson, Shaun and Osler, Thomas J., Extending Theon's ladder to any square root, College Mathematics Journal 35 (2004) pp. 222–226. Available as a PDF file, http://www.rowan.edulopen/depts/math/osler/my-papers1.htm Google Scholar
2. Osler, Thomas J., Wright, Marcus and Orchard, Michael, Theon's ladder for any root, International Journal of Mathematical Education in Science and Technology 36 (2005) pp.389–398. Available as a PDF file from http://www.rowan.edulopen/depts/math/osler/my-papers1.htm CrossRefGoogle Scholar
3. Ridenhour, J. R., Ladder approximations of irrational numbers, Mathematics Magazine 59 (1986) pp. 95–105.CrossRefGoogle Scholar
4. Young, Robert M., Excursions in calculus, an interplay of the continuous and the discrete, The Mathematical Association of America (1992).Google Scholar
5. Bauerochse, Tom R. G., Square Roots by an iterative method and its generalization to positive integral roots of order n, Mathematics Magazine 39 (1966) pp. 219–223.CrossRefGoogle Scholar
6. Johnson, Kenneth R., An iterative method for approximating square roots, Mathematics Magazine 62 (1989) pp. 253–259.CrossRefGoogle Scholar
7. Aieta, Joseph F., Powers and Roots by Recursion, College Mathematics Journal, 18 (1987), pp. 411–416.CrossRefGoogle Scholar
8. Hardy, G. H. and Wright, E. M., Introduction to the theory of numbers (5th edn.), Oxford University Press (1979).Google Scholar
9. Burton, D., Elementary number theory, McGraw-Hill (2005).Google Scholar
10. Barnard, S. and Child, J. M., Higher algebra, Macmillan (1969).Google Scholar