Question: Using the principle of mathematical induction, prove that for every integer n≥1,(32n−1) is divisible by 2n+2 but not by 2n+3.
My attempt:
Let P(n):(32n−1) is divisible by 2n+2 but not by 2n+3 (n≥1).
BASE CASE:
P(1):(321−1) is divisible by 21+2 but not by 21+3 , that is, 8 is divisible by 8 but not by 16, which is true.
∴P(1) is true
INDUCTION HYPOTHESIS:
Let P(n) be true for n=k.
∴P(k) is true, that is, (32k−1) is divisible by 2k+2 but not by 2k+3.
∴ Let 32k−1=λ.2k+2
⟹32k=1+λ.2k+2
INDUCTIVE STEP:
P(k+1):(32k+1−1) is divisible by 2k+1+2 but not by 2k+1+3
We have to prove that P(k+1) is true
32k+1−1=32k2−1=(1+λ.2k+2)2−1=1+2λ.2k+2+λ2.22(k+2)−1=λ.2k+3+λ2.2k+3+k+1=2k+3(λ+λ2.2k+1)
∴32k+1−1 is divisible by 2k+3
My problem: How do I prove that the number is not divisible by 2n+3? What should I add to the induction hypothesis part and the inductive step. I am not allowed to use congruence. I am allowed to use the properties of numbers and their division. I thought of doing it by proving that the number leaves a particular remainder on dividing by 2n+2 but then realized that it would be very cumbersome since the remainder can range from 1 to 2n+3−1.
Please help.
Answer
In the inductive step, your aim should be to prove that 32k+1−1 is divisible by 2k+3, not 2k+2. You should add to the inductive hypothesis that λ is odd. To be more precise: you should aim at proving this:32k−1 can be written as λ.2k+2 for some odd λ.If this holds for some k∈N, then32k+1−1=(λ+λ2.2k+1).2k+3and λ+λ2.2k+1 will be odd too.
No comments:
Post a Comment