Is it divisible?

True or False?

For any positive integer n , n, 6 n 1 6^n - 1 is divisible by 5.


Note: Use the principle of mathematical induction to verify this.

True False

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

10 solutions

Zach Abueg
Aug 1, 2017

Before the proof by induction, perhaps a simpler proof:

We might observe that powers of 6 6 always end in 6 6 , so the last digit of 6 n 1 6^n - 1 will always be 5 5 , which satisfies the divisibility rule for 5 5 .

-

1. 1. Show that the base case n = 1 n = 1 is true.

P ( 1 ) : 6 1 1 = 5 5 5 P(1) \ : \ 6^1 - 1 = 5 \Longrightarrow 5 \mid 5 \ \checkmark

2. 2. Assume 5 6 n 1 n N 5 \mid 6^n - 1 \ \forall \ n \in \mathbb{N} .

6 k 1 = 5 a Multiply both sides by 6 6 ( 6 k 1 ) = 6 ( 5 a ) 6 k + 1 6 = 5 ( 6 a ) = 5 b Now prove for n = k + 1 6 k + 1 1 = 5 c If 5 a and 5 b , then 5 a b ( 6 k + 1 1 ) ( 6 k + 1 6 ) = 5 ( b c ) = 5 d 5 = 5 d Thus, it is true for n = k + 1 \displaystyle \begin{aligned} 6^k - 1 & = 5a & \small \color{#3D99F6} \text{Multiply both sides by } 6 \\ 6 \left(6^k - 1\right) & = 6(5a) \\ {\color{#D61F06}{6^{k + 1} - 6}} & = 5(6a) = {\color{#D61F06}{5b}} & \small \color{#3D99F6} \text{Now prove for } n = k + 1 \\ {\color{#20A900}{6^{k + 1} - 1}} & = {\color{#20A900}{5c}} & \small \color{#3D99F6} \text{If } 5 \mid a \text{ and } 5 \mid b \text{, then } 5 \mid a - b \\ \implies {\color{#D61F06}{\left(6^{k + 1} - 1\right)}} - {\color{#20A900}{\left(6^{k + 1} - 6\right)}} & = 5({\color{#D61F06}{b}} - {\color{#20A900}{c}}) = 5d \\ \implies 5 & = 5d \ \checkmark & \small \color{#3D99F6} \text{Thus, it is true for } n = k + 1 \end{aligned}

3. 3. Since P ( n ) P(n) is true for n = 1 n = 1 and n = k + 1 n = k + 1 , it is true for all n n : 5 6 n 1 n N 5 \mid 6^n - 1 \ \forall \ n \in \mathbb{N} .

Great induction!

Steven Jim - 3 years, 10 months ago

Log in to reply

Thanks Steven! :)

Zach Abueg - 3 years, 10 months ago

How is my solution?

Md Zuhair - 3 years, 10 months ago

Log in to reply

Great intuition, to be honest.

Steven Jim - 3 years, 10 months ago

Log in to reply

Thanks sir!

Md Zuhair - 3 years, 10 months ago

Log in to reply

@Md Zuhair Fantastic! It basically makes my initial observation rigorous :)

Zach Abueg - 3 years, 10 months ago

Log in to reply

@Zach Abueg Thank you very much sir. Learnt all from the brilliant users and you. You all have a nice way of approaching questions. :)

Md Zuhair - 3 years, 8 months ago

The nice thing about the induction proof is that it can easily be extended to any integer (positive or otherwise) x - that x^k-1 is divisible by x-1, which also leads to, for all whole x and odd k, x^k+1 is divisible by x+1.

Gregory Lewis - 3 years, 9 months ago

Wow! and wow ! :)

Naren Bhandari - 3 years, 8 months ago

I'm pretty sure your 'simple solution' is the principle of induction. You basically say how we know the first one works and then the next one works thus, they all work.

Vasant Kurvari - 3 years, 7 months ago

6 n 1 ( 5 + 1 ) n 1 1 n 1 0 (mod 5) 6^n-1 \equiv (5+1)^n - 1 \equiv 1^n - 1 \equiv 0 \text{ (mod 5)} 6 n 1 \implies 6^n-1 is divisible by 5 for any positive integer n n .

Md Zuhair
Aug 1, 2017

We know 6 n = 6 m o d 10 6^n = 6 \mod 10

6 n 1 = 5 m o d 10 6^n -1 = 5 \mod 10

6 n 1 6^n-1 always ends with a 5 5 as per our proof. So 6 n 1 6^n-1 is always divisible by 5.

Good solution!

Steven Jim - 3 years, 10 months ago

Exactly, I do in the same way

Naren Bhandari - 3 years, 8 months ago

Why is it so obvious that 'We know that 6^n = 6 mod 10'. It's not obvious to me. Regards, David

David Fairer - 3 years, 7 months ago
Gautam Arya
Sep 14, 2017

A simple approach may save your time. Here it goes, 6 n 6^{n} mod 5 will always return 1 as remainder. For the above given question (1-1) mod 5 =0

Abesh Chatterjee
Nov 10, 2017

A simpler proof.. for any positive integer, the last digit of 6^n is 6(n>0) So (6^n-1) must be dividable by 5..

David Fairer
Nov 7, 2017

note that 1 is identical to 1^n. So the question becomes 'is (6^n - 1^n) divisible by 5 for all n. now (6^n - 1^n) = (6 - 1) x [6^(n-1) + 6^(n-2) + ........ + 6 + 1). So it is divisible by (6 - 1) i.e. 5! Regards, David

Stefano Gallenda
Nov 6, 2017

All powers of 6 ands by 6 so 6 n 1 6^n - 1 always and by 5, and so it is divisible by 5. t r u e \boxed{true}

Aman Thegreat
Sep 30, 2017

We know the cyclicity of 6 6 is 1 1 .

So whatever power 6 6 is raised to, i.e, 6 n 6^n , will always end with 6 6 for all positive integral values of n n

So 6 6 - 1 1 = 5 5

Hence 6 n 1 6^n -1 will always end with 5 5 and hence divisible by 5 5

Ajax Bjax
Sep 17, 2017

6 n 1 = ( 6 1 ) × ( 6 n 1 + 6 n 2 + 6 n 3 + + 6 2 + 6 1 + 1 ) 6^{n}-1=(6-1)\times(6^{n-1}+6^{n-2}+6^{n-3}+\cdots+6^{2}+6^{1}+1)

by a telescoping series expansion. Hence 6 n 1 6^{n}-1 is divisible by (6-1)=5.

Ayush Kumar
Sep 15, 2017

Because 6 to any power has a units digit of six (this due to the fact that 6 6 6*6 has this property and can be confirmed with basic modular arithmetic), we can subtract one from the number (leaving us with a units digit of 6 1 = 5 6-1=5 which makes the whole number divisible by 5 (the divisibility rule for 5).

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...