Excel in math, science, and engineering

New user? Sign up

Existing user? Sign in

Show that a perfect square cannot end with digits 2,3 or 7?

Note by Goutam Narayan 3 years, 4 months ago

Sort by:

We look modulo 10.A number can give remainder 0,1,2...9 mod 10.After checking for all of these values, we see that none of them are \(\equiv\) to 2,3 or 7 (mod 10) – Bogdan Simeonov · 3 years, 4 months ago

Log in to reply

@Bogdan Simeonov – can u plz show it – Goutam Narayan · 3 years, 4 months ago

@Goutam Narayan – Well ,when a number \( n=10k+r\), then \(n^2=100k^2 + 20kr + r^2 \equiv r^2 \pmod{10}\).Now for

\(r=1, n^2\equiv 1^2 \equiv 1\pmod {10}\)

\(r=2, n^2\equiv 2^2 \equiv 4 \pmod {10}\)

\(r=3, n^2\equiv 3^2 \equiv 9 \pmod{10}\)

\(r=4, n^2\equiv 4^2 \equiv 6 \pmod{10}\)

\(r=5, n^2\equiv 5^2 \equiv 5 \pmod{10}\)

\(r=6, n^2\equiv 6^2 \equiv 6 \pmod{10}\)

\(r=7, n^2\equiv 7^2 \equiv 9 \pmod{10}\)

\(r=8, n^2\equiv 8^2 \equiv 4 \pmod{10}\)

\(r=9, n^2\equiv 9^2 \equiv 1 \pmod{10}\) – Bogdan Simeonov · 3 years, 4 months ago

@Bogdan Simeonov – thank u very much/// – Goutam Narayan · 3 years, 4 months ago

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestWe look modulo 10.A number can give remainder 0,1,2...9 mod 10.After checking for all of these values, we see that none of them are \(\equiv\) to 2,3 or 7 (mod 10) – Bogdan Simeonov · 3 years, 4 months ago

Log in to reply

– Goutam Narayan · 3 years, 4 months ago

can u plz show itLog in to reply

\(r=1, n^2\equiv 1^2 \equiv 1\pmod {10}\)

\(r=2, n^2\equiv 2^2 \equiv 4 \pmod {10}\)

\(r=3, n^2\equiv 3^2 \equiv 9 \pmod{10}\)

\(r=4, n^2\equiv 4^2 \equiv 6 \pmod{10}\)

\(r=5, n^2\equiv 5^2 \equiv 5 \pmod{10}\)

\(r=6, n^2\equiv 6^2 \equiv 6 \pmod{10}\)

\(r=7, n^2\equiv 7^2 \equiv 9 \pmod{10}\)

\(r=8, n^2\equiv 8^2 \equiv 4 \pmod{10}\)

\(r=9, n^2\equiv 9^2 \equiv 1 \pmod{10}\) – Bogdan Simeonov · 3 years, 4 months ago

Log in to reply

– Goutam Narayan · 3 years, 4 months ago

thank u very much///Log in to reply