Square triangular number

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
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:

0, 1, 36, 1225, 41616, 1413721, 48024900, 1631432881, 55420693056, 1882672131025 (sequence A001110 in the OEIS)
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

[edit | edit source]

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

Nk=sk2=tk(tk+1)2.

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,

n=8N+112.

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

xk+1=2xkx1xk1,yk+1=2ykx1yk1.

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:

sk=yk,tk=xk12,Nk=yk2.

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

[edit | edit source]

In 1778 Leonhard Euler determined the explicit formula[1][2]: 12–13 

Nk=((3+22)k(322)k42)2.

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

Nk=132((1+2)2k(12)2k)2=132((1+2)4k2+(12)4k)=132((17+122)k2+(17122)k).

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

sk=(3+22)k(322)k42,tk=(3+22)k+(322)k24.

Recurrence relations

[edit | edit source]

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]: (12) 

Nk=34Nk1Nk2+2,with N0=0 and N1=1;Nk=(6Nk1Nk2)2,with N0=0 and N1=1.

We have[1][2]: 13 

sk=6sk1sk2,with s0=0 and s1=1;tk=6tk1tk2+2,with t0=0 and t1=1.

Other characterizations

[edit | edit source]

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:

(4n(n+1))(4n(n+1)+1)2=4n(n+1)2(2n+1)2.

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

[edit | edit source]
  • Cannonball problem, on numbers that are simultaneously square and square pyramidal
  • Sixth power, numbers that are simultaneously square and cubical

Notes

[edit | edit source]
  1. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ a b c Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
[edit | edit source]