Ask a New Question

Prove that if n is an odd positive integer, then 1 ≡ n2 (mod 4).

1 answer

n = 2k+1
n^2 = 4k^2+4k+1 = 4(k^2+k) + 1

Ask a New Question or answer this question.

Similar Questions

1. Assume that n is a positive integer. Use the proof by contradiction method to prove:If 7n + 4 is an even integer then n is an
1. 0 answers
Prove that a^3 ≡ a (mod 3) for every positive integer a.What I did: Assume a^3 ≡ a (mod 3) is true for every positive
1. 1 answer
Which of the following is true when you subtract integers?(1 point)Responses A positive integer minus a positive integer will
1. 1 answer
Which of the following is true when you subtract integers?(1 point)Responses A positive integer minus a positive integer will
1. 1 answer

more similar questions