In each case either prove the result by splitting into cases, or give a counterexample. (a) If

Question:

In each case either prove the result by splitting into cases, or give a counterexample.
(a) If n is any integer, then n2 = 4k + 1 for some integer k.
(b) If n is any odd integer, then n2 = 4k + 1 for some integer k.
(c) If n is any integer, n3 - n = 3k for some integer k.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: