Prove that 7^n - 1 is divisible by 6

  • Thread starter ialink
  • Start date
In summary: I'm not familiar enough with. I think i know what to do. I'm going to do appendix E with is about sigma notation. I think i'll be much more able...In summary, Ivara3 - b3 = a3 - a2b + a2b - ab2 + ab2 - b3, where a2(a - b), ab(a - b) and b2(a - b) are adding zero terms. The middle terms I added in the first line are just adding zero really, but they let me factor the cubes nicely. This can be extended to larger exponents, and for any positive integer n, really. When b = 1 as in your problem, it'll
  • #1
ialink
24
0

Homework Statement


Prove that 7^n - 1 is divisible by 6

Homework Equations




The Attempt at a Solution



I managed a solution were i use only the addition of 6^x were x is any postive integer. The solution i have workes until n = 3 but not after that.

7^n - 1 = 6^n + n*6^(n-1) + n*6^(n-2)...

7^1 - 1 = 6 = 6^1
7^2 - 1 = 48 = 6^2 + 2*6^1
7^3 - 1 = 342 = 6^3 + 3*6^2 + 3*6^1

I tried different other possibilities on this. I also thought about rewriting 7^n - 1 such that division by six is obvious but i couldn't think of a possibility. I'm guessing i need a totally different approach bu i don't know what approach.

Anyone got a clue on were to look? Proving has to go by mathematical induction but that for later.
 
Physics news on Phys.org
  • #2
Can you find a pattern in the factorization of these

a2 - b2
a3 - b3
...

to factor this?

an - bn
 
  • #3
a^2 - b^2 = (a+b)*(a-b) but that's af far a i come. Writing it in anything like (a+b)^n*(a-b)^n returns large qeues of powers but i couldn't figure it out to get a^3 - b^3 for a starter.

Can you give me some more information?

grtz
Ivar
 
  • #4
a3 - b3 = a3 - a2b + a2b - ab2 + ab2 - b3

= a2(a - b) + ab(a - b) + b2(a - b)

= (a - b)(a2 + ab + b2)

The middle terms I added in the first line are just adding zero really, but they let me factor the cubes nicely. This can be extended to larger exponents, and for any positive integer n, really. When b = 1 as in your problem, it'll fortunately be a little easier to write out some of the terms.
 
  • #5
For example: Multiply a5 + a4 b + a3 b2 + a2 b3 + a  b4 + b5 by (a - b).

What do you get?
 
Last edited:
  • #6
Suggestion: Consider writing 7^n as (1+6)^n.
 
  • #7
ialink said:
Anyone got a clue on were to look? Proving has to go by mathematical induction but that for later.

What do you mean "that for later"? Induction is the way to go.
 
  • #8
jbunniii said:
Suggestion: Consider writing 7^n as (1+6)^n.

Yes, this is a good idea.

Use the binomial expansion to expand (6 + 1)n.
 
  • #9
ArcanaNoir said:
What do you mean "that for later"? Induction is the way to go.

I mean that i first want to figure out the pattern. Induction comes after that
 
  • #10
Have you learned modular arithmetic? This exercise is rather trivial if you have...
 
  • #11
Hurkyl said:
Have you learned modular arithmetic? This exercise is rather trivial if you have...

No i haven't had that but figuring out it's pattern is not the only thing. In it's context you have to apply mathematical induction and that's the main goal of this an the coming 4 excercises. Is a reviewing chapter at the end of chapter one which has as main goal learing how to solve problems and which stragegies there are like:
* recognize something familiar
* recognize patterns
* use analogy
* introduce somthing extra
* take cases (splitting it up in several cases)
* establisch subgoals
* indirect reasoning
* mathematical induction

This one seems to be a combination of recognizing something familiar, recognize patterns, use analogy and mathematical induction.

with the comments i am coming in the right direction but I'm not there yet.

grtz
Ivar
 
Last edited:
  • #12
Hi ivar. The clearest and formal proof to this is through binomial expansion. Only until you have developed an intuition to the proof, then you can make other conclusive statement to it. Even for modular arithmetic, the fundamental proof comes from the binomial theorem
 
  • #13
icystrike said:
Hi ivar. The clearest and formal proof to this is through binomial expansion. Only until you have developed an intuition to the proof, then you can make other conclusive statement to it. Even for modular arithmetic, the fundamental proof comes from the binomial theorem

I've done some calculating:

(6+1)[itex]^{1}[/itex] = 6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{1}[/itex] - 1 = 6[itex]^{1}[/itex]

(6+1)[itex]^{2}[/itex] = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{2}[/itex] - 1 = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex]

(6+1)[itex]^{3}[/itex] = 6[itex]^{3}[/itex] + 3*6[itex]^{2}[/itex] +3*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{2}[/itex] - 1 = 6[itex]^{3}[/itex] + 3*6[itex]^{2}[/itex] + 3*6[itex]^{1}[/itex]

(6+1)[itex]^{4}[/itex] = 6[itex]^{4}[/itex] + 4*6[itex]^{3}[/itex] + 6*6[itex]^{2}[/itex] + 4*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{3}[/itex] - 1 = 6[itex]^{4}[/itex] + 4*6[itex]^{3}[/itex] + 6*6[itex]^{2}[/itex] + 4*6[itex]^{1}[/itex]

(6+1)[itex]^{5}[/itex] = 6[itex]^{5}[/itex] + 5*6[itex]^{4}[/itex] + 10*6[itex]^{3}[/itex] + 10*6[itex]^{2}[/itex] + 5*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{5}[/itex] - 1 = 6[itex]^{4}[/itex] + 5*6[itex]^{4}[/itex] + 10*6[itex]^{3}[/itex] + 10*6[itex]^{2}[/itex] + 5*6[itex]^{1}[/itex]

Any following (6+1)[itex]^{n}[/itex] can be deduced according to what is known as pascals triangle. What i guess from the comments is that by factoring i get a pattern formula. But considering that at (6+1)[itex]^{n}[/itex] the resulting expansion has n+1 parts i don't see a general formula appear.

Am i in the right direction?
 
Last edited:
  • #14
Otherwise, you can write in summative notation:

[tex]\left( 6+1\right) ^{n}[/tex]

[tex]=\sum_{r=0}^{n}\left( _{r}^{n}\right) 6^{r}[/tex]

[tex]=\sum_{r=1}^{n}\left( _{r}^{n}\right) 6^{r}+6^{0}[/tex]

[tex]=\sum_{r=1}^{n}\left( _{r}^{n}\right) 6^{r}+1[/tex]

[tex]=6K+1[/tex]
 
  • #15
Sigma I'm not familiar enough with. I think i know what to do. I'm going to do appendix E with is about sigma notation. I think i'll be much more able to solve this after having done this appendix. I've already done App A,C,D and they were all necesarry for chapter 1.

I'm going to let this one rest until i finished appendix E

thanks ye all so far.

grtz
Ivar
 
  • #16
If you don't know the binomial expansion for (a + b)n, (in this case a = 6, b = 1), then go back and try what Bohrok & I suggested earlier, particularly in posts #4 & #5.
 
Last edited:
  • #17
Hint. Use congruences:

[tex]
7 \equiv 1 \, (\mathrm{mod} \, 6)
[/tex]
[tex]
7^2 \equiv 1 \times 1 = 1 \, (\mathrm{mod} \, 6)
[/tex]
and so on. Then, just subtract a one from both sides.
 
  • #18
ialink said:
I've done some calculating:

(6+1)[itex]^{1}[/itex] = 6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{1}[/itex] - 1 = 6[itex]^{1}[/itex]

(6+1)[itex]^{2}[/itex] = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{2}[/itex] - 1 = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex]
I don't follow what you're trying to do here.
(6 + 1)1 = 7 [itex]\neq[/itex] 71 - 1
(6 + 1)2 = 72 = 49 [itex]\neq[/itex] 72 - 1 = 48


ialink said:
(6+1)[itex]^{3}[/itex] = 6[itex]^{3}[/itex] + 3*6[itex]^{2}[/itex] +3*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{2}[/itex] - 1 = 6[itex]^{3}[/itex] + 3*6[itex]^{2}[/itex] + 3*6[itex]^{1}[/itex]

(6+1)[itex]^{4}[/itex] = 6[itex]^{4}[/itex] + 4*6[itex]^{3}[/itex] + 6*6[itex]^{2}[/itex] + 4*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{3}[/itex] - 1 = 6[itex]^{4}[/itex] + 4*6[itex]^{3}[/itex] + 6*6[itex]^{2}[/itex] + 4*6[itex]^{1}[/itex]

(6+1)[itex]^{5}[/itex] = 6[itex]^{4}[/itex] + 5*6[itex]^{4}[/itex] + 10*6[itex]^{3}[/itex] + 10*6[itex]^{2}[/itex] + 5*6[itex]^{1}[/itex] + 6[itex]^{0}[/itex] [itex]\rightarrow[/itex] 7[itex]^{5}[/itex] - 1 = 6[itex]^{4}[/itex] + 5*6[itex]^{4}[/itex] + 10*6[itex]^{3}[/itex] + 10*6[itex]^{2}[/itex] + 5*6[itex]^{1}[/itex]

Any following (6+1)[itex]^{n}[/itex] can be deduced according to what is known as pascals triangle. What i guess from the comments is that by factoring i get a pattern formula. But considering that at (6+1)[itex]^{n}[/itex] the resulting expansion has n+1 parts i don't see a general formula appear.

Am i in the right direction?
 
  • #19
Mark44 said:
I don't follow what you're trying to do here.
(6 + 1)1 = 7 [itex]\neq[/itex] 71 - 1
(6 + 1)2 = 72 = 49 [itex]\neq[/itex] 72 - 1 = 48

Okay for instance if you expand (6+1)^2 you get 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex] + 1 (equal to 6[itex]^{0}[/itex]). The question was to prove that 7[itex]^{n}[/itex] - 1 is devisable by six so if al components are a multiplification of six this is proven for the particular instance.

Now if (6+1)[itex]^{2}[/itex] = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex] + 1 then 7[itex]^{2}[/itex] - 1 = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex] + 1 - 1 = 6[itex]^{2}[/itex] + 2*6[itex]^{1}[/itex]. Am I making sense to you now?

Forgive me my somtimes poor english for I'm dutch.

grtz
Ivar
 
  • #20
Hint:
If [itex]x = 6 k + 1[/itex] and [itex]y = 6 l + 1[/itex], then:

[tex]
x y = (6 k + 1)(6 l + 1) = 6^{2} k l + 6 k + 6 l + 1 = 6(6 k l + k + l) + 1 = 6 m + 1
[/tex]

Then, use mathematcal induction.
 

FAQ: Prove that 7^n - 1 is divisible by 6

What is the theorem used to prove that 7^n - 1 is divisible by 6?

The theorem used to prove this statement is the divisibility rule for 6. This rule states that a number is divisible by 6 if it is divisible by both 2 and 3.

What is the first step in proving that 7^n - 1 is divisible by 6?

The first step is to rewrite 7^n - 1 as (6 + 1)^n - 1, which can be expanded using the binomial theorem to get 6n + 1 - 1. This simplifies to 6n, which is clearly divisible by 6.

Why is it important to prove that 7^n - 1 is divisible by 6?

Proving this statement is important because it shows that the expression 7^n - 1 can be written as a multiple of 6, which may be useful in solving other problems or equations. It also demonstrates a fundamental understanding of divisibility and mathematical proof techniques.

Can this statement be proven using mathematical induction?

Yes, this statement can be proven using mathematical induction. The base case is n = 1, where 7^1 - 1 = 6, which is divisible by 6. Then, assuming the statement is true for n = k, the goal is to prove that it is also true for n = k + 1. By the inductive hypothesis, 7^k - 1 is divisible by 6, and using the binomial theorem as in the first step, we can show that 7^(k+1) - 1 is also divisible by 6. Therefore, the statement holds for all natural numbers n.

Is there a shortcut or formula for proving that 7^n - 1 is divisible by 6?

Yes, there is a formula known as Fermat's little theorem that states that for any prime number p and any integer a, a^p - a is divisible by p. In this case, we can use p = 3 and a = 7 to show that 7^3 - 7 is divisible by 3, which is equivalent to 7^n - 1 being divisible by 6. This method may be more efficient for larger values of n.

Similar threads

Back
Top