Photo AI
Question 13
Use the Question 13 Writing Booklet (a) Prove that for all integers n with n ≥ 3, if $2^n - 1$ is prime, then n cannot be even. (b) The numbers $a_n$, for integers... show full transcript
Step 1
Answer
To prove this, we can use a proof by contradiction. Assume that n is even, thus we can write n = 2k where k is an integer with k ≥ 2. Then,
Since k ≥ 2, both factors and are greater than 1, meaning has at least two proper factors. Hence, it cannot be prime, leading to a contradiction.
Step 2
Answer
We start with the base case where n = 1:
For the induction step, assume that the formula holds for n = k:
Now we need to prove it for n = k + 1:
Using the relation :
Using the cosine addition formula:
Thus, the proof holds for k + 1 and by mathematical induction, it holds for all integers n ≥ 1.
Step 3
Step 4
Step 5
Report Improved Results
Recommend to friends
Students Supported
Questions answered