Help needed with a likely rather obvious induction proof

In summary, the homework statement states that for all natural numbers n: 3^(2n+1)+2^(n-1) is divisible by 7. However, the attempt at a solution is stuck trying to get the multipliers out and is not certain of his math knowledge.
  • #1
Boombaard
10
0

Homework Statement


show that for all natural numbers n: 3^(2n+1)+2^(n-1) is divisible by 7

The Attempt at a Solution



i've been trying to get the second part of the proof to look like the first part, so as to be able to conclude some multiple is also divisible by 7, but i don't seem to get what needs to be done..
3^(2(n+1)+1)+2^(n+1-1) -> 3^(2n+2+1)+2^(n+1-1) -> 3²*3^(2n+1)+2*2^(n-1) (= 7*k)
only here i sort of get stuck trying to get the multipliers out, and I'm not certain enough of my math 'certain knowledge' otherwise to just posit that 3*(something)+2*(something) always yields multiples of 7 (not that it does, in this case)

am i really trying to go down the wrong path here? or am i just missing something entirely too obvious? :(
 
Physics news on Phys.org
  • #2
Yes, as you say, 3*(something)+ 2*(something) does NOT always yield multiples of 7 (for example if each "something" is 1, the sum is 5 which is not a multiple of 5 so you cannot "posit" that it always does!

What you need to show is that if 3^(2N+1)+2^(N-1) is a multiple of 7 for some specific N (do you see the difference between that and "3^(2n+1)+2^(n-1) is a multiple of 7 for all n?) then 3^(2(N+1)+1)+2^((N+1)-1) is also a multiple of 7.

3^(2(N+1)+1)+2^(N+1-1)= 3^(2N+1+2)+2^(N+1-1)= 3²*3^(2N+1)+2*2^(N-1)= 9(3^(2N+1))+2(2^(N-1))= 2[3^(2n+1)+ 2^(N-1)]+ 7(3^(2N+1). Now, you know that 3^(2N+1)+ 2^(N-1) is a multiple of 7: 3^(2N+1)- 2^(N-1)= 7m. What does that tell you about 2[3^(2n+1)+ 2^(N-1)]+ 7(3^(2N+1)?
 
  • #3
HallsofIvy said:
Yes, as you say, 3*(something)+ 2*(something) does NOT always yield multiples of 7 (for example if each "something" is 1, the sum is 5 which is not a multiple of 7) so you cannot "posit" that it always does!

What you need to show is that if 3^(2N+1)+2^(N-1) is a multiple of 7 for some specific N (do you see the difference between that and "3^(2n+1)+2^(n-1) is a multiple of 7 for all n?) then 3^(2(N+1)+1)+2^((N+1)-1) is also a multiple of 7.

3^(2(N+1)+1)+2^(N+1-1)= 3^(2N+1+2)+2^(N+1-1)= 3²*3^(2N+1)+2*2^(N-1)= 9(3^(2N+1))+2(2^(N-1))= 2[3^(2n+1)+ 2^(N-1)]+ 7(3^(2N+1). Now, you know that 3^(2N+1)+ 2^(N-1) is a multiple of 7: 3^(2N+1)- 2^(N-1)= 7m. What does that tell you about 2[3^(2n+1)+ 2^(N-1)]+ 7(3^(2N+1)?

ugh.. as i suspected, totally obvious :(
thank you for the quick reply, HallsofIvy :)
 
Last edited by a moderator:

FAQ: Help needed with a likely rather obvious induction proof

1. What is an induction proof?

An induction proof is a mathematical method used to prove that a statement is true for all natural numbers. It involves proving that the statement is true for the first natural number, typically 0 or 1, and then showing that if the statement is true for any arbitrary natural number, it must also be true for the next natural number. This process is repeated until it is shown to be true for all natural numbers.

2. How do you start an induction proof?

To start an induction proof, you must first state the statement you want to prove and then prove that it is true for the first natural number, typically 0 or 1. This is known as the base case. Afterwards, you must assume that the statement is true for an arbitrary natural number, also known as the induction hypothesis.

3. What is the role of the induction hypothesis in an induction proof?

The induction hypothesis is used to prove that the statement is true for the next natural number. By assuming that the statement is true for an arbitrary natural number, we can use this to prove that the statement is also true for the next natural number. This process is repeated until the statement is proven to be true for all natural numbers.

4. What is the difference between strong and weak induction?

In weak induction, we only use the previous natural number to prove the statement for the next natural number. However, in strong induction, we use all previous natural numbers to prove the statement for the next natural number. Strong induction is typically used when the statement involves multiple previous natural numbers.

5. How do you know when to use induction in a proof?

Induction is often used in proofs involving statements that are true for all natural numbers. This can include proving properties of sequences or series, inequalities, and divisibility. If you encounter a statement that seems to be true for all natural numbers, then induction may be a useful proof method to use.

Similar threads

Replies
2
Views
915
Replies
1
Views
1K
Replies
15
Views
2K
Replies
6
Views
2K
Replies
2
Views
608
Replies
3
Views
2K
Replies
11
Views
1K
Replies
4
Views
1K
Replies
2
Views
965
Back
Top