Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

Prove that if n is an integer, then n^2 mod 5 is either 0,1, or 4

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer

SEE EXPERT ANSWER

To see the expert answer you'll need to create a free account at Brainly

there are only five possible ways for n. first case: \(n \equiv 0(mod 5)\), then \(n^2 \equiv 0(mod 5)\) second case: \(n \equiv 1(mod 5)\)), then \(n^2 \equiv 1(mod 5)\) third case:\(n \equiv 2(mod 5)\)), then \(n^2 \equiv 4(mod 5)\) fourth case:\(n \equiv 3(mod 5)\)), then \(n^2 \equiv 6(mod 5)\), which is equal to \(n^2 \equiv 1(mod 5)\), as \(6 \equiv 1(mod 5)\) fifth case:\(n \equiv 4(mod 5)\)), then \(n^2 \equiv 16(mod 5)\) which is equal to \(n^2 \equiv 1(mod 5)\), as \(16 \equiv 1(mod 5)\) so we conclude that if n is an integer, n^2 mod 5 is either 0,1, or 4
sorry, for fourth case, it's \(n^2 \equiv 9 (mod 5)\) and it's equal to \(n^2 \equiv 4 (mod 5)\)
Excellent, but how do we know that there are only five possible values for n?

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

because the remainder for any integer k divided by an integer n has only n-1 remainders. e.g. for 2, you can only get 0 or 1 as remainder. any other remainder means that the division is incomplete.
sorry it'snot n-1, it's n. but the range is 0,1,2,3,...,n-1

Not the answer you are looking for?

Search for more explanations.

Ask your own question