SOLUTION: Prove that 3 divides 20^2n − 1 for all n = 0, 1, 2, 3, . . ..
Algebra.Com
Question 1020241: Prove that 3 divides 20^2n − 1 for all n = 0, 1, 2, 3, . . ..
Answer by Fombitz(32388) (Show Source): You can put this solution on YOUR website!
When ,
divisible by 3.
When ,
divisible by 3 since it ends in 9.
When ,
divisible by 3 since it ends in 9.
As you see the number is a power of 400 so the last digit will always be 0.
Subtracting 1 makes it the last digit a 9 so it will always be divisible by 3.
RELATED QUESTIONS
Prove that
1^2 + 3^2 + . . . + (2n − 1)^2 =1/3(4n^3 − n)
for all natural... (answered by robertb)
Hello,
could I please have some help with this question,
Prove by mathematical... (answered by KMST)
For any integer n, prove that
1) 3 divides one of the integers n, n + 1 or 2n + 1.
2) 3 (answered by ikleyn)
Prove that 2C(2n − 1,n) = C(2n,n) for all n >... (answered by greenestamps)
Pls help
USE MATHEMATICAL INDUCTION TO PROVE THAT
(n+1)^n < 2n^2 for all natural... (answered by ikleyn)
Mathematical induction
How can we prove that :
(1 + 1 / 3) (1 + 5 / 4)(1 + 7 /... (answered by ikleyn)
use mathematical induction to prove that
1^2 + 2^2 + 3^2 +...+ n^2 = n(n+1)(2n+1)/6... (answered by solver91311)
Prove by induction that 3^n ≥ 2n +1 for all positive... (answered by josgarithmetic)
Prove by mathematical induction that:
2^2n - 1 is divisible by 3 for all positive... (answered by Edwin McCravy)