Proof by Induction and divisibility

In summary, to prove that 8^n - 3^n (n >= 1) is divisible by 5 using mathematical induction, we first prove that 8^1 - 3^1 is divisible by 5, and then use the induction hypothesis to show that 8^(k+1) - 3^(k+1) is also divisible by 5 if k = n. We can do this by factoring out 24 from 8*8^k - 3*3^k and using the fact that 8^k - 3^k is already divisible by 5. Similarly, to prove 1^2 + 3^2 + 5^2 + ... + (
  • #1
Caldus
106
0
How would I go about proving that 8^n - 3^n (n >= 1) is divisible by 5 using mathematical induction? I tried this but I do not think it is right:

First, prove that 8^1 - 3^1 is divisible by 5. 8^1 - 3^1 = 5, which is divisible by 5.

Second, prove that 8^(k+1) - 3^(k+1) is divisible by 5 if k = n. Notice that 8^(k+1) - 3^(k+1) =

8*(8^k) - 3^k(3). Based on the induction hypothesis, we already know that 8^k - 3^k is divisible by 5. So we end up with 24*(8^k - 3^k), which is always divisible by 5 because the term inside the parenthesis is already divisible by 5. Multiplying that by any number will not change the fact that it is divisible by 5.

Am I right here? Thanks.
 
Mathematics news on Phys.org
  • #2
How did you figure this:
[tex]8*8^k - 3*3^k = 24(8^k - 3^k)[/tex]
?? You were doing fine up until that point. What you need to do is this:
[tex]8*8^k - 3*3^k = 5*8^k + 3*8^k + 3*3^k = 5*8^k + 3(8^k - 3^k)[/tex]
 
  • #3
OK, I'm having trouble with this one as well. Can someone help me?

1^2 + 3^2 + 5^2 + ... + (2n - 1)^2 = (n(2n - 1)(2n + 1))/3
 
  • #4
[tex]1^2 + 3^2 + 5^2 + ... + (2n - 1)^2 = \frac{n(2n - 1)(2n + 1)}{3} = \frac{4n^3 - n}{3}[/tex]

So for [tex]k = n + 1[/tex]:
[tex]1^2 + 3^2 + 5^2 + ... + (2n - 1)^2 + (2n + 1)^2 = \frac{(n + 1)(2n + 1)(2n + 3)}{3}[/tex]
[tex]\underline{1^2 + 3^2 + 5^2 + ... + (2n - 1)^2} + (2n + 1)^2 = \frac{4n^3 + 12n^2 + 11n + 3}{3}[/tex]
We already know it's true for [tex]n[/tex] so you can replace the underlined part:
[tex]\frac{4n^3 - n}{3} + (2n + 1)^2 = \frac{4n^3 - n}{3} + 4n^2 + 4n + 1 = \frac{4n^3 + 12n^2 + 11n + 3}{3}[/tex]
Multiply by 3:
[tex]4n^3 - n + 12n^2 + 12n + 3 = 4n^3 + 12n^2 + 11n + 3[/tex]
QED.
 
  • #5
I have seen a beautiful geometrical way of deriving the sum of cubes of numbers, i.e. 1^3 + 2^3 + ... + n^3 = (1+2+...n)^2.

I wonder if there are simple ways of deriving [tex]1^2 + 3^2 + 5^2 + ... + (2n - 1)^2 = \frac{n(2n - 1)(2n + 1)}{3}[/tex]
 
  • #6
You can prove this:
[tex]1^2 + 3^2 + 5^2 + ... + (2n - 1)^2 = \frac{n(2n - 1)(2n + 1)}{3}[/tex]
With a bit of geometry, yes. If you draw squares with a side of 1, 3, 5, etc., one below the other, you can find the sum of their areas with a bit of manipulation, but it's not exactly simple (the idea is simple, the equations are a bit big though).
 
  • #7
I have a problem:
Knowing that [tex]1^2 + 2^2 + 3^2 + ... + n^2 = \frac{n(n + 1)(2n + 1)}{6}[/tex]and that [tex]1^3 + 2^3 + 3^3 + ... + n^3 = \frac{n^2 (n + 1)^2 } {4}[/tex], calculate [tex]1^4 + 2^4 + 3^4 + ... + n^4[/tex].
Please, help me!
 
Last edited:

FAQ: Proof by Induction and divisibility

1. What is proof by induction?

Proof by induction is a mathematical technique used to prove that a statement is true for all natural numbers. It involves three steps: base case, induction hypothesis, and inductive step.

2. How is proof by induction related to divisibility?

Proof by induction can be used to prove statements about divisibility, such as showing that a certain number is divisible by another number for all natural numbers.

3. What is the base case in a proof by induction?

The base case is the first natural number for which the statement is true. It serves as the starting point for the inductive proof.

4. What is the induction hypothesis in proof by induction?

The induction hypothesis is the assumption that the statement is true for a particular natural number. This assumption is used to prove that the statement is also true for the next natural number.

5. How does the inductive step work in proof by induction?

The inductive step involves using the induction hypothesis to prove that the statement is true for the next natural number. This process is repeated until it can be shown that the statement is true for all natural numbers.

Similar threads

Replies
8
Views
2K
Replies
7
Views
3K
Replies
13
Views
2K
Replies
4
Views
2K
Replies
7
Views
2K
Replies
11
Views
2K
2
Replies
47
Views
5K
Replies
2
Views
2K
Back
Top