Prove that for all integers n, ifn mod5=3 then n2 mod 5=4.
Chapter 4, Problem 4.197(choose chapter or problem)
Prove that for all integers n, ifn mod5=3 then n2 mod 5=4.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer