Squares and perfect square numbers

Definition. If $n$ is a natural number, its square is $n^2 = n \times n$, and any number expressible this way is called a perfect square (or square number).

where: $n$ is the natural number being squared, and $n^2$ is the resulting perfect square.

Property 1 — units-digit pattern. Squaring every digit $0$ through $9$ gives units digits $0,1,4,9,6,5,6,9,4,1$. Since the units digit of $n^2$ depends only on the units digit of $n$, a perfect square can end only in $0, 1, 4, 5, 6$ or $9$, and can never end in $2, 3, 7$ or $8$.

Property 2 — trailing zeros come in pairs. If a perfect square ends in zeros, the count of trailing zeros is always even: $100 = 10^2$ and $10000 = 100^2$ qualify, but $1000$ (three zeros) never can.

Property 3 — sum of consecutive odd numbers. $n^2$ equals the sum of the first $n$ odd numbers:

where: the right side has exactly $n$ terms, the odd numbers from $1$ up to $2n-1$. For example, $1+3+5+7 = 16 = 4^2$.

Property 4 — gap between consecutive squares. Between $n^2$ and $(n+1)^2$ there are exactly $2n$ non-square numbers, because $(n+1)^2 - n^2 = 2n+1$ (the two endpoints themselves are squares, leaving $2n$ numbers strictly between them). Between $3^2=9$ and $4^2=16$, for instance, there are $2\times3=6$ such numbers: $10,11,12,13,14,15$.

Property 5 — odd/even parity. The square of an even number is even; the square of an odd number is odd, since $(2k)^2 = 4k^2$ is even and $(2k+1)^2 = 4k^2+4k+1$ is odd.

Pythagorean triplets from squares. Three natural numbers $(a,b,c)$ form a Pythagorean triplet if $a^2+b^2=c^2$. Given any $m>1$, the pattern

where: $m$ is a whole number greater than $1$; $2m$ and $m^2-1$ become the two smaller members of the triplet and $m^2+1$ the largest, always generates one. This is a pattern-based construction for Class 8 — it is not derived from the Pythagoras theorem, which is studied in a later grade.

Squaring every digit from $0$ to $9$ produces the units digits $0,1,4,9,6,5,6,9,4,1$ — the digits $2,3,7,8$ never appear anywhere in that list. Because the units digit of $n^2$ is fixed entirely by the units digit of $n$ (the tens, hundreds, and higher digits contribute only to higher place values when you expand the multiplication), this same short list of six endings, $0,1,4,5,6,9$, repeats for every perfect square no matter how large the number is, which is exactly why $57$, $123$, and $998$ can be rejected on sight — a number ending in $2,3,7$ or $8$ simply cannot be reached by squaring any integer, however large. The trailing-zero rule follows a similar logic: if $n = 10^k \times p$ where $p$ is not divisible by $10$, then $n^2 = 10^{2k} \times p^2$, so the zeros contributed by squaring a multiple of ten always double in count — hence they must appear in pairs.

Is 5776 a perfect square? Check using the units-digit and trailing-zero rules first, then confirm by finding its square root, and separately generate the Pythagorean triplet for $m=6$.

Step 1. The units digit of $5776$ is $6$, which is on the allowed list $\{0,1,4,5,6,9\}$, so the number is not ruled out immediately. There are no trailing zeros to check.

Step 2. Estimate the size of the root using nearby known squares: $70^2 = 4900$ and $80^2 = 6400$. Since $4900 < 5776 < 6400$, the square root of $5776$, if it exists, lies strictly between $70$ and $80$.

Step 3. Narrow the units digit of the root. A root ending in $4$ or $6$ produces a square ending in $6$ (since $4^2=16$ and $6^2=36$), so the candidates between $70$ and $80$ are $74$ and $76$.

Step 4. Test the candidates directly: $76 \times 76 = 5776$. ✓ So $5776 = 76^2$ is indeed a perfect square, with root $76$.

Step 5. Now generate a Pythagorean triplet with $m=6$ using $(2m,\ m^2-1,\ m^2+1)$: $2m = 12$, $m^2-1 = 36-1=35$, $m^2+1=36+1=37$, giving the triplet $(12, 35, 37)$.

Step 6. Verify: $12^2 + 35^2 = 144 + 1225 = 1369$, and $37^2 = 1369$. Both sides match, confirming $(12,35,37)$ satisfies $a^2+b^2=c^2$.

5776 is a perfect square equal to $76^2$, and $m=6$ generates the valid Pythagorean triplet $(12, 35, 37)$.

Competitive stretch

Quiz and Olympiad problems often ask you to rule out a list of numbers at once. For $\{123, 5776, 8000, 4096\}$: $123$ ends in $3$ (rejected), $5776$ passes and checks out as $76^2$ (shown above), $8000$ has three trailing zeros (odd count, rejected), and $4096$ ends in $6$, lies between $60^2=3600$ and $70^2=4900$, and testing $64^2 = 4096$ confirms it. Scanning digits first saves time before any long multiplication.

• Believing that an "allowed" units digit ($0,1,4,5,6,9$) guarantees a perfect square — the rule only eliminates candidates; it never proves a number is a square by itself, as the extra estimation and testing steps above show.
• Forgetting trailing zeros must come in pairs — a number like $4000$ can look "round" but its three zeros disqualify it instantly, no further checking needed.
• Misplacing terms in the Pythagorean-triplet formula, or choosing $m=1$, which gives $m^2-1=0$, an invalid triplet member; $m$ must be greater than $1$.
• Assuming the formula generates every triplet for a given set of numbers — a triplet like $(6,8,10)$ is just $(3,4,5)$ scaled up, and does not appear directly from this formula for any single small $m$.

Ask the tutor: Want to practise ruling numbers in or out, or generate a few more Pythagorean triplets step by step?