Square number
In mathematics, a square number or perfect square is an integer that is the square of an integer;^{[1]} in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals 3^{2} and can be written as 3 × 3.
The usual notation for the square of a number n is not the product n × n, but the equivalent exponentiation n^{2}, usually pronounced as "n squared". The name square number comes from the name of the shape. The unit of area is defined as the area of a unit square (1 × 1). Hence, a square with side length n has area n^{2}. If a square number is represented by n points, the points can be arranged in rows as a square each side of which has the same number of points as the square root of n; thus, square numbers are a type of figurate numbers (other examples being cube numbers and triangular numbers).
Square numbers are non-negative. A non-negative integer is a square number when its square root is again an integer. For example, [math]\displaystyle{ \sqrt{9} = 3, }[/math] so 9 is a square number.
A positive integer that has no square divisors except 1 is called square-free.
For a non-negative integer n, the nth square number is n^{2}, with 0^{2} = 0 being the zeroth one. The concept of square can be extended to some other number systems. If rational numbers are included, then a square is the ratio of two square integers, and, conversely, the ratio of two square integers is a square, for example, [math]\displaystyle{ \textstyle \frac{4}{9} = \left(\frac{2}{3}\right)^2 }[/math].
Starting with 1, there are [math]\displaystyle{ \lfloor \sqrt{m} \rfloor }[/math] square numbers up to and including m, where the expression [math]\displaystyle{ \lfloor x \rfloor }[/math] represents the floor of the number x.
Examples
The squares (sequence A000290 in the OEIS) smaller than 60^{2} = 3600 are:
- 0^{2} = 0
- 1^{2} = 1
- 2^{2} = 4
- 3^{2} = 9
- 4^{2} = 16
- 5^{2} = 25
- 6^{2} = 36
- 7^{2} = 49
- 8^{2} = 64
- 9^{2} = 81
- 10^{2} = 100
- 11^{2} = 121
- 12^{2} = 144
- 13^{2} = 169
- 14^{2} = 196
- 15^{2} = 225
- 16^{2} = 256
- 17^{2} = 289
- 18^{2} = 324
- 19^{2} = 361
- 20^{2} = 400
- 21^{2} = 441
- 22^{2} = 484
- 23^{2} = 529
- 24^{2} = 576
- 25^{2} = 625
- 26^{2} = 676
- 27^{2} = 729
- 28^{2} = 784
- 29^{2} = 841
- 30^{2} = 900
- 31^{2} = 961
- 32^{2} = 1024
- 33^{2} = 1089
- 34^{2} = 1156
- 35^{2} = 1225
- 36^{2} = 1296
- 37^{2} = 1369
- 38^{2} = 1444
- 39^{2} = 1521
- 40^{2} = 1600
- 41^{2} = 1681
- 42^{2} = 1764
- 43^{2} = 1849
- 44^{2} = 1936
- 45^{2} = 2025
- 46^{2} = 2116
- 47^{2} = 2209
- 48^{2} = 2304
- 49^{2} = 2401
- 50^{2} = 2500
- 51^{2} = 2601
- 52^{2} = 2704
- 53^{2} = 2809
- 54^{2} = 2916
- 55^{2} = 3025
- 56^{2} = 3136
- 57^{2} = 3249
- 58^{2} = 3364
- 59^{2} = 3481
The difference between any perfect square and its predecessor is given by the identity n^{2} − (n − 1)^{2} = 2n − 1. Equivalently, it is possible to count square numbers by adding together the last square, the last square's root, and the current root, that is, n^{2} = (n − 1)^{2} + (n − 1) + n.
Properties
The number m is a square number if and only if one can arrange m points in a square:
m = 1^{2} = 1 | |
m = 2^{2} = 4 | |
m = 3^{2} = 9 | |
m = 4^{2} = 16 | |
m = 5^{2} = 25 |
The expression for the nth square number is n^{2}. This is also equal to the sum of the first n odd numbers as can be seen in the above pictures, where a square results from the previous one by adding an odd number of points (shown in magenta). The formula follows:
- [math]\displaystyle{ n^2 = \sum_{k=1}^n(2k-1). }[/math]
For example, 5^{2} = 25 = 1 + 3 + 5 + 7 + 9.
There are several recursive methods for computing square numbers. For example, the nth square number can be computed from the previous square by n^{2} = (n − 1)^{2} + (n − 1) + n = (n − 1)^{2} + (2n − 1). Alternatively, the nth square number can be calculated from the previous two by doubling the (n − 1)th square, subtracting the (n − 2)th square number, and adding 2, because n^{2} = 2(n − 1)^{2} − (n − 2)^{2} + 2. For example,
- 2 × 5^{2} − 4^{2} + 2 = 2 × 25 − 16 + 2 = 50 − 16 + 2 = 36 = 6^{2}.
The square minus one of a number m is always the product of [math]\displaystyle{ m - 1 }[/math] and [math]\displaystyle{ m + 1; }[/math] that is,
- [math]\displaystyle{ m^2-1=(m-1)(m+1). }[/math]
For example, since [math]\displaystyle{ 7^2=49, }[/math] one has [math]\displaystyle{ 6\times 8=48. }[/math] It follows that 3 is the only prime number one less than a square (3 = 2^{2} − 1). More generally, the difference of the squares of two numbers is the product of their sum and their difference. That is,
- [math]\displaystyle{ a^2-b^2=(a+b)(a-b) }[/math]
(this is the difference-of-squares formula). This can be useful for mental arithmetic: for example, 47 × 53 can be easily computed as 50^{2} − 3^{2} = 2500 − 9 = 2491.
A square number is also the sum of two consecutive triangular numbers. The sum of two consecutive square numbers is a centered square number. Every odd square is also a centered octagonal number.
Another property of a square number is that (except 0) it has an odd number of positive divisors, while other natural numbers have an even number of positive divisors. An integer root is the only divisor that pairs up with itself to yield the square number, while other divisors come in pairs.
Lagrange's four-square theorem states that any positive integer can be written as the sum of four or fewer perfect squares. Three squares are not sufficient for numbers of the form 4^{k}(8m + 7). A positive integer can be represented as a sum of two squares precisely if its prime factorization contains no odd powers of primes of the form 4k + 3. This is generalized by Waring's problem.
In base 10, a square number can end only with digits 0, 1, 4, 5, 6 or 9, as follows:
- if the last digit of a number is 0, its square ends in 00;
- if the last digit of a number is 1 or 9, its square ends in an even digit followed by a 1;
- if the last digit of a number is 2 or 8, its square ends in an even digit followed by a 4;
- if the last digit of a number is 3 or 7, its square ends in an even digit followed by a 9;
- if the last digit of a number is 4 or 6, its square ends in an odd digit followed by a 6; and
- if the last digit of a number is 5, its square ends in 25.
In base 12, a square number can end only with square digits (like in base 12, a prime number can end only with prime digits or 1), that is, 0, 1, 4 or 9, as follows:
- if a number is divisible both by 2 and by 3 (that is, divisible by 6), its square ends in 0, and its preceding digit must be 0 or 3;
- if a number is divisible neither by 2 nor by 3, its square ends in 1, and its preceding digit must be even;
- if a number is divisible by 2, but not by 3, its square ends in 4, and its preceding digit must be 0, 1, 4, 5, 8, or 9; and
- if a number is not divisible by 2, but by 3, its square ends in 9, and its preceding digit must be 0 or 6.
Similar rules can be given for other bases, or for earlier digits (the tens instead of the units digit, for example). All such rules can be proved by checking a fixed number of cases and using modular arithmetic.
In general, if a prime p divides a square number m then the square of p must also divide m; if p fails to divide m/p, then m is definitely not square. Repeating the divisions of the previous sentence, one concludes that every prime must divide a given perfect square an even number of times (including possibly 0 times). Thus, the number m is a square number if and only if, in its canonical representation, all exponents are even.
Squarity testing can be used as alternative way in factorization of large numbers. Instead of testing for divisibility, test for squarity: for given m and some number k, if k^{2} − m is the square of an integer n then k − n divides m. (This is an application of the factorization of a difference of two squares.) For example, 100^{2} − 9991 is the square of 3, so consequently 100 − 3 divides 9991. This test is deterministic for odd divisors in the range from k − n to k + n where k covers some range of natural numbers [math]\displaystyle{ k \geq \sqrt{m}. }[/math]
A square number cannot be a perfect number.
The sum of the n first square numbers is
- [math]\displaystyle{ \sum_{n=0}^N n^2 = 0^2 + 1^2 + 2^2 + 3^2 + 4^2 + \cdots + N^2 = \frac{N(N+1)(2N+1)}{6}. }[/math]
The first values of these sums, the square pyramidal numbers, are: (sequence A000330 in the OEIS)
0, 1, 5, 14, 30, 55, 91, 140, 204, 285, 385, 506, 650, 819, 1015, 1240, 1496, 1785, 2109, 2470, 2870, 3311, 3795, 4324, 4900, 5525, 6201...
The sum of the first odd integers, beginning with one, is a perfect square: 1, 1 + 3, 1 + 3 + 5, 1 + 3 + 5 + 7, etc. This explains Galileo's law of odd numbers: if a body falling from rest covers one unit of distance in the first arbitrary time interval, it covers 3, 5, 7, etc., units of distance in subsequent time intervals of the same length. From s = ut + 1/2at^{2}, for u = 0 and constant a (acceleration due to gravity without air resistance); so s is proportional to t^{2}, and the distance from the starting point are consecutive squares for integer values of time elapsed.^{[2]}
The sum of the n first cubes is the square of the sum of the n first positive integers; this is Nicomachus's theorem.
All fourth powers, sixth powers, eighth powers and so on are perfect squares.
A unique relationship with triangular numbers [math]\displaystyle{ T_n }[/math] is:
- [math]\displaystyle{ (T_n)^2+(T_{n+1})^2=T_{(n+1)^2} }[/math]
Odd and even square numbers
Squares of even numbers are even, and are divisible by 4, since (2n)^{2} = 4n^{2}. Squares of odd numbers are odd, and are congruent to 1 modulo 8, since (2n + 1)^{2} = 4n(n + 1) + 1, and n(n + 1) is always even. In other words, all odd square numbers have a remainder of 1 when divided by 8.
Every odd perfect square is a centered octagonal number. The difference between any two odd perfect squares is a multiple of 8. The difference between 1 and any higher odd perfect square always is eight times a triangular number, while the difference between 9 and any higher odd perfect square is eight times a triangular number minus eight. Since all triangular numbers have an odd factor, but no two values of 2^{n} differ by an amount containing an odd factor, the only perfect square of the form 2^{n} − 1 is 1, and the only perfect square of the form 2^{n} + 1 is 9.
Special cases
- If the number is of the form m5 where m represents the preceding digits, its square is n25 where n = m(m + 1) and represents digits before 25. For example, the square of 65 can be calculated by n = 6 × (6 + 1) = 42 which makes the square equal to 4225.
- If the number is of the form m0 where m represents the preceding digits, its square is n00 where n = m^{2}. For example, the square of 70 is 4900.
- If the number has two digits and is of the form 5m where m represents the units digit, its square is aabb where aa = 25 + m and bb = m^{2}. Example: To calculate the square of 57, 25 + 7 = 32 and 7^{2} = 49, which means 57^{2} = 3249.
- If the number ends in 5, its square will end in 5; similarly for ending in 25, 625, 0625, 90625, ... 8212890625, etc. If the number ends in 6, its square will end in 6, similarly for ending in 76, 376, 9376, 09376, ... 1787109376. For example, the square of 55376 is 3066501376, both ending in 376. (The numbers 5, 6, 25, 76, etc. are called automorphic numbers. They are sequence A003226 in the OEIS.^{[3]})
- In base 10, the last two digits of square numbers follow a repeating pattern mirror symmetrical around multiples of 25, so for example, 24^{2}=576 and 26^{2}=676, and in general (25n+x)^{2}-(25n-x)^{2}=100nx. An analogous pattern applies for the last 3 digits around multiples of 250, and so on. As a consequence, of the 100 possible last 2 digits, only 22 of them occur among square numbers (since 00 and 25 are repeated).
See also
- Brahmagupta–Fibonacci identity – Expression of a product of sums of squares as a sum of squares
- Cubic number – Number raised to the third power
- Euler's four-square identity – Product of sums of four squares expressed as a sum of four squares
- Fermat's theorem on sums of two squares – Condition under which an odd prime is a sum of two squares
- Some identities involving several squares
- Integer square root – Greatest integer less than or equal to square root
- Methods of computing square roots – Algorithms for calculating square roots
- Power of two – Two raised to an integer power
- Pythagorean triple – Integer side lengths of a right triangle
- Quadratic residue – Integer that is a perfect square modulo some integer
- Quadratic function – Polynomial function of degree two
- Square triangular number – Integer that is both a perfect square and a triangular number
Notes
- ↑ Some authors also call squares of rational numbers perfect squares.
- ↑ Olenick, Richard P.; Apostol, Tom M.; Goodstein, David L. (2008-01-14) (in en). The Mechanical Universe: Introduction to Mechanics and Heat. Cambridge University Press. pp. 18. ISBN 978-0-521-71592-8. https://books.google.com/books?id=xMWwTpn53KsC&pg=PA18.
- ↑ Sloane, N. J. A., ed. "Sequence A003226 (Automorphic numbers: n^2 ends with n.)". OEIS Foundation. https://oeis.org/A003226.
Further reading
- Conway, J. H. and Guy, R. K. The Book of Numbers. New York: Springer-Verlag, pp. 30–32, 1996. ISBN 0-387-97993-X
- Kiran Parulekar. Amazing Properties of Squares and Their Calculations. Kiran Anil Parulekar, 2012 https://books.google.com/books?id=njEtt7rfexEC&source=gbs_navlinks_s
Original source: https://en.wikipedia.org/wiki/Square number.
Read more |