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 n ≥... show full transcript
Step 1
Answer
To prove this statement, we will utilize a proof by contradiction. Assume that n is even. Therefore, we can express n as n = 2k for some integer k ≥ 2. Substituting this back, we get:
Notably, both factors, and , are greater than 1 when k ≥ 2, meaning that has proper divisors. Hence, cannot be prime. This contradiction indicates that our assumption must be incorrect, thus if is prime, n cannot be even.
Step 2
Answer
Base Case (n=1):
For n = 1, Checking the right-hand side: This shows both sides are equal.
Inductive Step:
Assume the statement holds for n = k, i.e., . We need to show it holds for n = k + 1: Substituting our inductive hypothesis: Simplifying gives us: Factor out 4: Now using the identity for to express this in terms of confirms our induction statement proving: .
Step 3
Step 4
Step 5
Report Improved Results
Recommend to friends
Students Supported
Questions answered