Ask a New Question

Asked by Don

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

Answers

Answered by Steve
n = 2k+1
n^2 = 4k^2+4k+1 = 4(k^2+k) + 1
12 years ago
There are no AI answers yet. The ability to request AI answers is coming soon!

Submit Your Answer


We prioritize human answers over AI answers.

If you are human, and you can answer this question, please submit your answer.

Related Questions

Prove that if n is an odd positive integer, then 1 ≡ n(power of 2) (mod 4). Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has... The mean of five non-zero positive integers is 20. The median is 24. What is the maximum possible... 1. Which of the following positions holds that moral beliefs vary from person to person, and that on... Let s(t)=-5t^2+40t be the position equation for a rock thrown upwards. At what time t, in seconds, w... How do you find the least positive angle that is conterminal to 3pie The sum of 11 consecutive positive integers is 2002. What is the greatest of these 11 integers? **... I have to write about the positive effects of an investor buying stocks of a company but I would lik... This is a 35-year-old HIV-positive male with progressive lymphadenopathy and unexplained fevers, nig... is -3.3(-2.6) negetive or positive
Submit Your Answer

Question

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

Ask a New Question
Archives Contact Us Privacy Policy Terms of Use