Ask a New Question

Question

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

Answers

Steve
n = 2k+1
n^2 = 4k^2+4k+1 = 4(k^2+k) + 1
11 years ago

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... 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... The mean of five non-zero positive integers is 20. The median is 24. What is the maximum possible... How is AI being used in a positve way and how can it be used in a negative way? What are some featu... Prove that there exists a positive constant $c$ such that the following statement is true: Consid... What does it mean to have positive social health? Is –682,980 + 5,794,781 positive or negative? Although did have some positives like creating a uniform legal code, it generally created unrest...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use