SOLUTION: Prove algebraically that when n squared is divided by 4, the remainder is 1. N is any odd number.
Algebra.Com
Question 210775: Prove algebraically that when n squared is divided by 4, the remainder is 1. N is any odd number.
Answer by Alan3354(69443) (Show Source): You can put this solution on YOUR website!
Prove algebraically that when n squared is divided by 4, the remainder is 1. N is any odd number.
-----------
Any odd number can be represented by
2n+1, where n is any integer.
N = 2n+1
(2n+1)^2 = 4n^2 + 4n + 1
(4n^2 + 4n + 1)/4 = n^2 + n Remainder 1
QED
RELATED QUESTIONS
What is the lowest number n that when divided by 3 leaves a remainder of 1, when divided... (answered by ikleyn)
When 270 is divided by the odd number n, the quotient is a positive prime number
and the (answered by solver91311)
The natural number n is the smallest number satisfying the following properties: when... (answered by ankor@dixie-net.com,fcabanski,richard1234)
When a number n is divided by 7, the remainder is 2. What is the remainder when 2n+1 is... (answered by Edwin McCravy)
A number N when divided by 5 leaves remainder 1 and when divided by 6 leaves remainder 3. (answered by rothauserc)
What is that number , when that number is divided by 9 the remainder is 8 , when that... (answered by AnlytcPhil)
The number n is a two digit number. When n is divided by 10 the remainder is 9, when n is (answered by ankor@dixie-net.com)
if n is an integer greater then 1, such that n divided by 4 yields a remainder of 0,... (answered by tommyt3rd)
When n is divided by 5, the remainder is 4. When n is divided by 4, the remainder is 3.... (answered by checkley77,Theo)