Proof by Induction: Solving 34n-1 Divisible by 80

In summary, the conversation revolves around proving that 34n - 1 is divisible by 80. Different approaches are suggested, including setting a base and using induction, checking for divisibility by 16 and 5, and simplifying the equation to 80*3^4n. The conversation ends with the person feeling more prepared to teach the concept to their students.
  • #1
Damo
4
0
As a student, proofs always troubled me, now as a teacher they are still causing me grief.
How would you do this one?

Prove 34n - 1 is divisible by 80.

I understand the process, setting the base and writing as n=k, then n=k+1 etc. But this has stumped me.
 
Physics news on Phys.org
  • #2
Try adding:

\(\displaystyle \left(3^{4(n+1)}-1\right)-\left(3^{4n}-1\right)=80\cdot3^{4n}\)

to your induction hypothesis. :D
 
  • #3
Hi,

$80=2^4 5$, so you need to check that $3^{4n}-1$ is zero modulo 16 and zero modulo 5 for every $n$.

$3^4=81 \equiv 1 \ (mod \ 16)$ so $3^{4n}\equiv 1 \ (mod \ 16)$.

$3^4=81 \equiv 1 \ (mod \ 5)$ so $3^{4n}\equiv 1 \ (mod \ 5)$.

so it must be divisible by 80.

PS: MarkFL was faster =P
 
  • #4
Or even more directly:
$$3^{4n} - 1 \equiv \left ( 3^{4} \right )^n - 1 \equiv 81^n - 1 \equiv 1^n - 1 \equiv 1 - 1 \equiv 0 \pmod{80}$$
Alternative proof:
$$3^{4n} - 1 = \left ( 3^{4} \right )^n - 1 = 81^n - 1 = 80 \left ( 81^{n - 1} + 81^{n - 2} + \cdots + 1 \right )$$
Of course, neither uses induction, but still.
 
  • #5
MarkFL said:
Try adding:

\(\displaystyle \left(3^{4(n+1)}-1\right)-\left(3^{4n}-1\right)=80\cdot3^{4n}\)

to your induction hypothesis. :D

I understand the Left hand side of this equation but where/why is the right hand side \(\displaystyle 80\cdot3^{4n}\)?
 
  • #6
Damo said:
I understand the Left hand side of this equation but where/why is the right hand side \(\displaystyle 80\cdot3^{4n}\)?

If follows by simplification:

\(\displaystyle \left(3^{4(n+1)}-1\right)-\left(3^{4n}-1\right)=3^{4(n+1)}-3^{4n}=3^{4n+4}-3^{4n}=81\cdot3^{4n}-3^{4n}=80\cdot3^{4n}\)
 
  • #7
Thank you guys for your responses. I think I have it now and will now work on how to communicate it to my students. We are doing a brief intro to mathematical induction in class on Thursday and I was feeling underprepared!

Thanks for your help!
 

FAQ: Proof by Induction: Solving 34n-1 Divisible by 80

1. What is proof by induction and how is it used to solve 34n-1 divisible by 80?

Proof by induction is a mathematical technique used to prove statements or equations that involve a variable, such as n. To solve 34n-1 divisible by 80, we use proof by induction to show that the statement holds true for all possible values of n.

2. What is the first step in using proof by induction to solve 34n-1 divisible by 80?

The first step is to prove that the statement is true for the base case, which is typically n = 0 or n = 1. In this case, we would show that 34^0-1 = 0 is divisible by 80.

3. What is the second step in using proof by induction to solve 34n-1 divisible by 80?

The second step is to assume that the statement is true for some arbitrary value of n, and then prove that it is also true for n+1. This is called the inductive step.

4. How do we prove the inductive step in solving 34n-1 divisible by 80?

To prove the inductive step, we substitute n+1 for n in the equation 34n-1 and show that it is also divisible by 80. We can do this by simplifying the equation using algebraic techniques.

5. Why is proof by induction a valid method for solving 34n-1 divisible by 80?

Proof by induction is a valid method because it follows a logical and structured approach to proving a statement for all possible values of n. By proving the statement for the base case and showing that it holds true for n+1 whenever it is true for n, we can conclude that it is true for all possible values of n.

Similar threads

Replies
4
Views
3K
Replies
4
Views
5K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
7
Views
2K
Replies
10
Views
2K
Replies
2
Views
2K
Back
Top