A divisibility problem

Yue Kwok Choy

Question
Prove that 2
3n
1 is divisible by 7 , where n is a natural number .
Method 1 Mathematical Induction
Let Pn! be the "ro"osition # 2
3n
1 $ 7a
n
, where a
n
is a natural number .
%or Pn!, 2
31!
1 $ & 1 $ 7 $ 7a
1
, where a
1
$ 1 is a natural number .
'ssume Pk! is true (or some natural number k , that is,
2
3k
1 $ 7a
k
, where a
k
is a natural number ). 1!
%or Pk * 1!,
2
3k*1!
1 $ 2
3k*3
1 $ &2
3k
! 1 $ &2
3k
1! * 7 $ & 7a
k
! * 7 , by 1! .
$ 7&a
k
* 1! $ 7a
k*1
, where a
k*1
$ &a
k
* 1 is a natural number .
Pk * 1! is true .
+y the Prin,i"le o( -athemati,al .ndu,tion, Pn! is true (or all natural numbers n .
2
3n
1 is divisible by 7 , where n is a natural number .
Method 2 Binominal Theorem
2
3n
1 $ &
n
1 $ 7 * 1!
n
1
( ) ( ) ( ) [ ] 1 1 1 7 C ... 1 7 C 1 7 C 7
n 1 n n
1 n
2 2 n n
2
1 n n
1
n
+ + + + + =

, by +inominal /heorem .
7 C ... 7 C 7 C 7
n
1 n
2 n n
2
1 n n
1
n

+ + + + =
( )
n
1 n
3 n n
2
2 n n
1
1 n
C ... 7 C 7 C 7 7


+ + + + =
0in,e
n
r
C is a natural number, 2
3n
1 is obviously divisible by 7 .
Method 3 Factor Theorem
Let (n! $ 1
n
a
n
, where n is a natural number .
0in,e (a! $ a
n
a
n
$ 2
+y %a,tor /heorem, 1
n
a
n
is divisible by 1 a! .
Puttin3 1 $ & , a $ 1, we have #
&
n
1
n
is divisible by & 1!
2
3n
1 is divisible by 7 , where n is a natural number .
1
Note : 1
n
a
n
$ 1 a! 1
n41
* 1
n42
a * 1
n43
a
2
* ) * 1a
n42

* a
n41
!
5en,e 2
3n
1 $ 7&
n41
* &
n42
* ) * & * 1!
Method !eometric "eries
%or 3eometri, series, we have the (ormula#
( )
1 r
1 r
a n 0
n

= , where a is the (irst term, r is the ,ommon ratio o( 6eom. series

1 &
1 &
1 & ... & & & 1
n
1 n 3 2

= + + + + +

5en,e, 2
3n
1 $ 7&
n41
* &
n42
* ) * & * 1!
Method # Binary number
2
3
1!
12!

$ 111
2!
2
7
1!
12!

$ 111,111
2!
5en,e, we have 2
3n
1!
12!

$ 111,111,),111
2!
there are 3n number o( 1 or
n 3rou"s o( 111!
'lso, 7
12!
$ 111
2!
.
2
3n
1!
12!
8 7
12!
$ 111,111,),111
2!
8 111
2!
$ 1,221, ), 221
2!
2
3n
1 is divisible by 7 , where n is a natural number .
Method $ Base %
+ase & 3ives an even sim"ler "roo( . ',,ordin3 to the de(inition o( base &,
&
n
!
12!
$ 122 )222
&!
there are n 9eros!
&
n
1!
12!
$ 77 )77
&!
there are n sevens!
2
3n
1!
12!
8 7
12!
$ 77 )77
&!
87
&!
$ 11 )11
&!

2
3n
1 is divisible by 7 , where n is a natural number .
Method & Modular arithmetic
.( a, b, n are inte3ers, a b is an inte3er multi"le o( n , we write a b mod n! .
%or those who know modular arithmeti,, the "roo( is sim"le#
:bserve that & 1 mod 7! &
n
1
n
mod 7! 1 mod 7!
2
3n
1 mod 7!
2
2
3n
1 is divisible by 7 , where n is a natural number .
3