Square triangular number

For squares of triangular numbers, see squared triangular number.

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 perfect square. 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).

Explicit formulas

Write N_k for the kth square triangular number, and write s_k and t_k for the sides of the corresponding square and triangle, so that

N_{k}=s_{k}^{2}={\frac {t_{k}(t_{k}+1)}{2}}.

Define the triangular root of a triangular number $N={\frac {n(n+1)}{2}}$ to be $n$ . From this definition and the quadratic formula, $n={\frac {{\sqrt {8N+1}}-1}{2}}.$ Therefore, $N$ is triangular if and only if $8N+1$ is square. Consequently, a number $M^{2}$ is square and triangular if and only if $8M^{2}+1$ is square, i. e., there are numbers $x$ and $y$ such that $x^{2}-8y^{2}=1$ . This is an instance of the Pell equation, with $n=8$ . All Pell equations have the trivial solution (1,0), for any n; this solution is called the zeroth, and indexed as $(x_{0},y_{0})$ . If $(x_{k},y_{k})$ denotes the k'th non-trivial solution to any Pell equation for a particular n, it can be shown by the method of descent that $x_{{k+1}}=2x_{k}x_{1}-x_{{k-1}}$ and $y_{{k+1}}=2y_{k}x_{1}-y_{{k-1}}$ . Hence there are an infinity of solutions to any Pell equation for which there is one non-trivial one, which holds whenever n is not a square. The first non-trivial solution when n=8 is easy to find: it is (3,1). A solution $(x_k,y_k)$ to the Pell equation for n=8 yields a square triangular number and its square and triangular roots as follows: $s_{k}=y_{k},t_{k}={\frac {x_{k}-1}{2}},$ and $N_{k}=y_{k}^{2}.$ Hence, the first square triangular number, derived from (3,1), is 1, and the next, derived from (17,6) (=6×(3,1)-(1,0)), is 36.

The sequences N_k, s_k and t_k are the OEIS sequences A001110, A001109, and A001108 respectively.

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

N_{k}=\left({\frac {(3+2{\sqrt {2}})^{k}-(3-2{\sqrt {2}})^{k}}{4{\sqrt {2}}}}\right)^{2}.

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

{\begin{aligned}N_{k}&={1 \over 32}\left((1+{\sqrt {2}})^{{2k}}-(1-{\sqrt {2}})^{{2k}}\right)^{2}={1 \over 32}\left((1+{\sqrt {2}})^{{4k}}-2+(1-{\sqrt {2}})^{{4k}}\right)\\&={1 \over 32}\left((17+12{\sqrt {2}})^{k}-2+(17-12{\sqrt {2}})^{k}\right).\end{aligned}}

The corresponding explicit formulas for s_k and t_k are ^[2]^:13

s_{k}={\frac {(3+2{\sqrt {2}})^{k}-(3-2{\sqrt {2}})^{k}}{4{\sqrt {2}}}}

and

t_{k}={\frac {(3+2{\sqrt {2}})^{k}+(3-2{\sqrt {2}})^{k}-2}{4}}.

Pell's equation

The problem of finding square triangular numbers reduces to Pell's equation in the following way.^[3] Every triangular number is of the form t(t + 1)/2. Therefore we seek integers t, s such that

{\frac {t(t+1)}{2}}=s^{2}.

With a bit of algebra this becomes

(2t+1)^{2}=8s^{2}+1,

and then letting x = 2t + 1 and y = 2s, we get the Diophantine equation

x^{2}-2y^{2}=1

which is an instance of Pell's equation. This particular equation is solved by the Pell numbers P_k as^[4]

x=P_{{2k}}+P_{{2k-1}},\quad y=P_{{2k}};

and therefore all solutions are given by

s_{k}={\frac {P_{{2k}}}{2}},\quad t_{k}={\frac {P_{{2k}}+P_{{2k-1}}-1}{2}},\quad N_{k}=\left({\frac {P_{{2k}}}{2}}\right)^{2}.

There are many identities about the Pell numbers, and these translate into identities about the square triangular numbers.

Recurrence relations

There are recurrence relations for the square triangular numbers, as well as for the sides of the square and triangle involved. We have^[5]^:(12)

N_{k}=34N_{{k-1}}-N_{{k-2}}+2,{\text{ with }}N_{0}=0{\text{ and }}N_{1}=1.

N_{k}=\left(6{\sqrt {N_{{k-1}}}}-{\sqrt {N_{{k-2}}}}\right)^{2},{\text{ with }}N_{0}=0{\text{ and }}N_{1}=1.

We have^[1]^[2]^:13

s_{k}=6s_{{k-1}}-s_{{k-2}},{\text{ with }}s_{0}=0{\text{ and }}s_{1}=1;

t_{k}=6t_{{k-1}}-t_{{k-2}}+2,{\text{ with }}t_{0}=0{\text{ and }}t_{1}=1.

Other characterizations

All square triangular numbers have the form b²c², where b / c is a convergent to the continued fraction for the square root of 2.^[6]

A. V. Sylwester gave a short proof that there are an infinity of square triangular numbers, to wit:^[7]

If the triangular number n(n+1)/2 is square, then so is the larger triangular number

{\frac {{\bigl (}4n(n+1){\bigr )}{\bigl (}4n(n+1)+1{\bigr )}}{2}}=2^{2}\,{\frac {n(n+1)}{2}}\,(2n+1)^{2}.

We know this result has to be a square, because it is a product of three squares: 2^2 (by the exponent), (n(n+1))/2 (the n'th triangular number, by proof assumption), and the (2n+1)^2 (by the exponent). The product of any numbers that are squares is naturally going to result in another square. This can be seen from the fact that a necessary and sufficient condition for a number to be square is that there should be only even powers of primes in its prime factorisation, and multiplying two square numbers preserves this property in the product.

The triangular roots $t_{k}$ are alternately simultaneously one less than a square and twice a square, if k is even, and simultaneously a square and one less than twice a square, if k is odd. Thus, $49=7^{2}=2*5^{2}-1,288=17^{2}-1=2*12^{2}$ , and $1681=41^{2}=2*29^{2}-1.$ In each case, the two square roots involved multiply to give $s_{k}:5*7=35,12*17=204,$ and $29*41=1189.$

$N_{k}-N_{{k-1}}=s_{{2k-1}}:36-1=35,1225-36=1189,$ and $41616-1225=40391.$ In other words, the difference between two consecutive square triangular numbers is the square root of another square triangular number.

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

{\frac {1+z}{(1-z)(z^{2}-34z+1)}}=1+36z+1225z^{2}+\cdots .

Numerical data

As $k$ becomes larger, the ratio $t_{k}/s_{k}$ approaches ${\sqrt {2}}\approx 1.41421356$ and the ratio of successive square triangular numbers approaches $(1+{\sqrt {2}})^{4}=17+12{\sqrt {2}}\approx 33.970562748$ . The table below shows values of $k$ between 0 and 11, which comprehend all square triangular numbers up to $100\,000\,000$ .

$k$	$N_{k}$	$s_{k}$	$t_{k}$	$t_{k}/s_{k}$	$N_{k}/N_{{k-1}}$
$0$	$0$	$0$	$0$
$1$	$1$	$1$	$1$	$1.00000000$
$2$	$36$	$6$	$8$	$1.33333333$	$36.000000000$
$3$	$1\,225$	$35$	$49$	$1.40000000$	$34.027777778$
$4$	$41\,616$	$204$	$288$	$1.41176471$	$33.972244898$
$5$	$1\,413\,721$	$1\,189$	$1\,681$	$1.41379310$	$33.970612265$
$6$	$48\,024\,900$	$6\,930$	$9\,800$	$1.41414141$	$33.970564206$
$7$	$1\,631\,432\,881$	$40\,391$	$57\,121$	$1.41420118$	$33.970562791$
$8$	$55\,420\,693\,056$	$235\,416$	$332\,928$	$1.41421144$	$33.970562750$
$9$	$1\,882\,672\,131\,025$	$1\,372\,105$	$1\,940\,449$	$1.41421320$	$33.970562749$
$10$	$63\,955\,431\,761\,796$	$7\,997\,214$	$11\,309\,768$	$1.41421350$	$33.970562748$
$11$	$2\,172\,602\,007\,770\,041$	$46\,611\,179$	$65\,918\,161$	$1.41421355$	$33.970562748$

Notes

1 2 Dickson, Leonard Eugene (1999) [1920]. History of the Theory of Numbers. 2. Providence: American Mathematical Society. p. 16. ISBN 978-0-8218-1935-7.
1 2 3 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)". Memoires de l'academie des sciences de St.-Petersbourg (in Latin). 4: 3–17. Retrieved 2009-05-11. According to the records, it was presented to the St. Petersburg Academy on May 4, 1778.
↑ Barbeau, Edward (2003). Pell's Equation. Problem Books in Mathematics. New York: Springer. pp. 16–17. ISBN 978-0-387-95529-2. Retrieved 2009-05-10.
↑ Hardy, G. H.; Wright, E. M. (1979). An Introduction to the Theory of Numbers (5th ed.). Oxford University Press. p. 210. ISBN 0-19-853171-0. Theorem 244
↑ Weisstein, Eric W. "Square Triangular Number". MathWorld.
↑ 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.
↑ Pietenpol, J. L.; A. V. Sylwester; Erwin Just; R. M Warten (February 1962). "Elementary Problems and Solutions: E 1473, Square Triangular Numbers". American Mathematical Monthly. Mathematical Association of America. 69 (2): 168–169. doi:10.2307/2312558. ISSN 0002-9890. JSTOR 2312558.
↑ Plouffe, Simon (August 1992). "1031 Generating Functions" (PDF). University of Quebec, Laboratoire de combinatoire et d'informatique mathématique. p. A.129. Retrieved 2009-05-11.

External links

Michael Dummett's solution

Classes of natural numbers

Powers and
related numbers

Of the form
a × 2^b ± 1

Other polynomial
numbers

Recursively defined
numbers

Possessing a
specific set
of other numbers

Expressible via
specific sums

Generated
via a sieve

Lucky

Code related

Meertens

Figurate numbers

2-dimensional

centered	Centered triangular Centered square Centered pentagonal Centered hexagonal Centered heptagonal Centered octagonal Centered nonagonal Centered decagonal Star

non-centered	Triangular Square Square triangular Pentagonal Hexagonal Heptagonal Octagonal Nonagonal Decagonal Dodecagonal

3-dimensional

centered	Centered tetrahedral Centered cube Centered octahedral Centered dodecahedral Centered icosahedral

non-centered	Tetrahedral Octahedral Dodecahedral Icosahedral Stella octangula

pyramidal	Square pyramidal Pentagonal pyramidal Hexagonal pyramidal Heptagonal pyramidal

4-dimensional

centered	Centered pentachoric Squared triangular

non-centered	Pentatope

Pseudoprimes

Combinatorial
numbers

Arithmetic functions

By properties of σ(n)	Abundant Almost perfect Arithmetic Colossally abundant Descartes Hemiperfect Highly abundant Highly composite Hyperperfect Multiply perfect Perfect Practical number Primitive abundant Quasiperfect Refactorable Sublime Superabundant Superior highly composite Superperfect

By properties of Ω(n)	Almost prime Semiprime

By properties of φ(n)	Highly cototient Highly totient Noncototient Nontotient Perfect totient Sparsely totient

By properties of s(n)	Amicable Betrothed Deficient Semiperfect

Dividing a quotient

Other prime factor
or divisor related
numbers

Recreational
mathematics

Base-dependent
numbers

This article is issued from Wikipedia - version of the 9/25/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.