answersLogoWhite

0


Best Answer

No because it is impossible.

Let mod(x.3) denote the remainder when x is divided by 3. Let n be any integer. Then mod(n,3) = 0,1 or 2.

When mod(n,3) = 0, mod(n2,3) = 0

When mod(n,3) = 1, mod(n2,3) = 1

When mod(n,3) = 2, mod(n2,3) = 4 and, equivalently mod(n2,3) = 1.

So, there are no integers whose squar leaves a remainder of 2 when divided by 3.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Can you find a square number that when divided by 3 has a remainder of 2?
Write your answer...
Submit
Still have questions?
magnify glass
imp