If n >= 1 is an integer, prove that 2^(2n) - 1 is divisible by 3. Is there a formal way to prove this or can I just demonstrate it by plugging in n = 1,2,3,etc?
Proving by "plugging in" would involve an infinite number of cases.
try using induction
My problem is the only induction I know is plugging examples in!
OK, how did this happen: 4(2^(2n) - 1 + 1) - 1 = 4 - 1?
let it put it up again, \[ 2^{2n + 2} - 1 = 4 \cdot2^{2n} - 1 = 4 (2^{2n} - 1 + 1)- 1\] you know 3 divides 2^(2n) - 1 from assumption of induction. \[ 4 (2^{2n} - 1) + 4 - 1 = 4 \cdot (2^{2n }-1) + 3 \] since 3 divides both terms, it divides the whole thing.
also notice that \[ 2^{2n} = 4^n = (3 + 1)^n = 3 \times (\text{something}) + 1 \] you can use this to show that the reminder is 1
When I assume what I'm trying to prove to be true, what are the things I must do to make the whole argument valid?
do you know how to use induction?
this is my first problem in induction? Semester started this week.
avoiding induction, I will give another way, \[f(n)= 4^n-1 \] the values of the sum of the digits of f(n) takes a function represented by g(n): \[3n+1 \]thus 3n+1-1 is divisible by 3
Oh!! first put few values of n to show that it is true like, n=1,2,3 ... up to some number 'k' if it holds for k+1 assuming it holds for k, then it holds for any finite number.
@Ahmad1 seeing that made me remember \[ 4^n - 1 = (4 - 1)\cdot (1 + 4 + 4^2 + \dots + 4^{n-1})\] it holds trivially
I don't understand this "the values of the sum of the digits of f(n) takes a function represented by g(n):3n+1"
@Ahmad1 what did I miss?
that is just another way of looking at the problem 4^n -1 = 3k 4^n = 3k + 1 for some integer k
Oh I see. I get it now. Thanks everybody.
have seen this theorem? http://en.wikipedia.org/wiki/Fermat's_little_theorem
nope and I don't know modular arithmetic.
Join our real-time social learning platform and learn together with your friends!