Ask a New Question

Asked by Vevea Tepou

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


13 years ago

Answers

Answered by Mae
Use Mathematical Induction to prove that    1
1
.2 1 2 2.
n
i n
r
i n 

   
8 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

If sinx= 5/13, and x is a positive acute angle, find sin (x + 3pi/2) Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has... Prove that if n is an odd positive integer, then 1 ≡ n2 (mod 4). 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... 10.If the average of four positive integers is 12, what is the largest possie value of one of those... Can standing in different positions make you weigh less on a beam scale? If so, how to stand? (More... I have to write about the positive effects of an investor buying stocks of a company but I would lik... How do you find the least positive angle that is conterminal to 3pie The mean of five non-zero positive integers is 20. The median is 24. What is the maximum possible...
Submit Your Answer

Question

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


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