Square triangular number

From Wikipedia, the free encyclopedia

Template:Short description Script error: No such module "For".

Square triangular number 36 depicted as a triangular number and as a square number.

In mathematics, a square triangular number (or triangular square number) is a number which is both a triangular number and a square number, in other words, the sum of all integers from 1 to n has a square root that is an integer. There are infinitely many square triangular numbers; the first few are: Template:Bi

N
A001110
s2 = N
A001109
t(t+1)/2 = N
A001108
0 0 0
1 1 1
36 6 8
1225 35 49
41616 204 288
1413721 1189 1681
48024900 6930 9800

Solution as a Pell equation

Write Nk for the kth square triangular number, and write sk and tk for the sides of the corresponding square and triangle, so that

Template:Bi

Define the triangular root of a triangular number N=n(n+1)2 to be n. In the form of the quadratic equation, n2+n2N=0. From the quadratic formula,

Template:Bi

Therefore, N is triangular (n is an integer) if and only if 8N+1 is square. Consequently, a square number M2 is also triangular if and only if 8M2+1 is square, that is, there are numbers x and y such that x28y2=1. This is an instance of the Pell equation x2ny2=1 with n=8. All Pell equations have the trivial solution x=1,y=0 for any n; this is called the zeroth solution, and indexed as (x0,y0)=(1,0). If (xk,yk) denotes the kth nontrivial solution to any Pell equation for a particular n, it can be shown by the method of descent that the next solution is Template:Bi Hence there are infinitely many solutions to any Pell equation for which there is one non-trivial one, which is true whenever n is not a square. The first non-trivial solution when n=8 is easy to find: it is (3,1). A solution (xk,yk) to the Pell equation for n=8 yields a square triangular number and its square and triangular roots as follows:

Template:Bi

Hence, the first square triangular number, derived from (3,1), is 1, and the next, derived from 6(3,1)(1,0)=(17,6), is 36.

The sequences Nk, sk and tk are the OEIS sequences OEISA001110, OEISA001109, and OEISA001108 respectively.

Explicit formula

In 1778 Leonhard Euler determined the explicit formula[1][2]Template:Rp

Template:Bi

Other equivalent formulas (obtained by expanding this formula) that may be convenient include

Template:Bi

The corresponding explicit formulas for sk and tk are:[2]Template:Rp

Template:Bi

Recurrence relations

The solution to the Pell equation can be expressed as a recurrence relation for the equation's solutions. This can be translated into recurrence equations that directly express the square triangular numbers, as well as the sides of the square and triangle involved. We have[3]Template:Rp

Template:Bi

We have[1][2]Template:Rp

Template:Bi

Other characterizations

All square triangular numbers have the form b2c2, where bc is a convergent to the continued fraction expansion of 2, the square root of 2.[4]

A. V. Sylwester gave a short proof that there are infinitely many square triangular numbers: If the nth triangular number n(n+1)2 is square, then so is the larger 4n(n+1)th triangular number, since:

Template:Bi

The left hand side of this equation is in the form of a triangular number, and as the product of three squares, the right hand side is square.[5]

The generating function for the square triangular numbers is:[6]

1+z(1z)(z234z+1)=1+36z+1225z2+

See also

  • Cannonball problem, on numbers that are simultaneously square and square pyramidal
  • Sixth power, numbers that are simultaneously square and cubical

Notes

Page Template:Reflist/styles.css has no content.

  1. ^ a b Page Module:Citation/CS1/styles.css has no content.Dickson, Leonard Eugene (1999) [1920]. History of the Theory of Numbers. Vol. 2. Providence: American Mathematical Society. p. 16. ISBN 978-0-8218-1935-7.
  2. ^ a b c Page Module:Citation/CS1/styles.css has no content.Euler, Leonhard (1813). "Regula facilis problemata Diophantea per numeros integros expedite resolvendi (An easy rule for Diophantine problems which are to be resolved quickly by integral numbers)". Mémoires de l'Académie des Sciences de St.-Pétersbourg (in Latina). 4: 3–17. Retrieved 2009-05-11. According to the records, it was presented to the St. Petersburg Academy on May 4, 1778.
  3. ^ Script error: No such module "Template wrapper".
  4. ^ Page Module:Citation/CS1/styles.css has no content.Ball, W. W. Rouse; Coxeter, H. S. M. (1987). Mathematical Recreations and Essays. New York: Dover Publications. p. 59. ISBN 978-0-486-25357-2.
  5. ^ Page Module:Citation/CS1/styles.css has no content.Pietenpol, J. L.; Sylwester, A. V.; Just, Erwin; Warten, R. M. (February 1962). "Elementary Problems and Solutions: E 1473, Square Triangular Numbers". American Mathematical Monthly. 69 (2). Mathematical Association of America: 168–169. doi:10.2307/2312558. ISSN 0002-9890. JSTOR 2312558.
  6. ^ Page Module:Citation/CS1/styles.css has no content.Plouffe, Simon (August 1992). "1031 Generating Functions" (PDF). University of Quebec, Laboratoire de combinatoire et d'informatique mathématique. p. A.129. Archived from the original (PDF) on 2012-08-20. Retrieved 2009-05-11.

Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.