True or false :
is always divisible by 66, for all positive integer .
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.
Let us reduce the expression. − 6 6 n 7 + 6 6 n 5 is divisible by 66. 3 3 n 1 0 − 3 3 n 3 = 3 3 n 3 ( n 7 − 1 ) if n is even, n 3 is even and if n is odd, n 7 − 1 is even so either way 3 3 n 1 0 − 3 3 n 3 is divisble by 66.
So we only require to check if 6 n 1 1 + 5 5 n 9 + 5 n is divisible by 66. If n is even the expression is even and if n is odd, 5 5 n 9 + 5 n are both odd so their sum is even so the expression is divisible by 2 for all n.
6 n 1 1 is divisible by 3. 5 5 ≡ 1 ( m o d 3 ) , 5 ≡ 2 ( m o d 3 ) . So 5 5 n 9 + 5 n ≡ n 9 + 2 n ≡ n ( n 8 + 2 ) ( m o d 3 ) . If n is divisible by 3, 5 5 n 9 + 5 n is divisible by 3. If n ≡ 1 ( m o d 3 ) , 5 5 n 9 + 5 n ≡ n ( n 8 + 2 ) ≡ 1 × 3 ≡ 0 ( m o d 3 ) as any number which is 1 ( m o d 3 ) raised to any power is also ≡ 1 ( m o d 3 ) .
If n ≡ 2 ( m o d 3 ) , 5 5 n 9 + 5 n ≡ n ( n 8 + 2 ) ≡ 2 × 3 ≡ 0 ( m o d 3 ) as 8 is even and any number which is ≡ 2 ( m o d 3 ) raised to the power of an even number is ≡ 1 ( m o d 3 ) .
So, 5 5 n 9 + 5 n is always divisible by 3, so 6 n 1 1 + 5 5 n 9 + 5 n is always divisible by 6.
So, it suffices to check whether 6 n 1 1 + 5 5 n 9 + 5 n is divisible by 11.
5 5 n 9 is divisible by 11. So it suffices to check whether 6 n 1 1 + 5 n = n ( 6 n 1 0 + 5 ) is divisible by 11.
Now we have lots of case work to do.
If n ≡ 0 ( m o d 1 1 ) , the expression is divisible by 11.
If n ≡ 1 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 1 ( 6 + 5 ) ≡ 0 ( m o d 1 1 ) .
If n ≡ 2 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 2 ( 6 × 2 1 0 + 5 ) . As 2 5 ≡ − 1 ( m o d 1 1 ) , 2 1 0 ≡ 1 ( m o d 1 1 ) . So, 2 ( 6 × 2 1 0 + 5 ) ≡ 2 ( 6 + 5 ) ≡ 0 ( m o d 1 1 ) .
If n ≡ 3 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 3 ( 6 × 3 1 0 + 5 ) . As 3 5 ≡ 1 ( m o d 1 1 ) , 3 1 0 ≡ 1 ( m o d 1 1 ) . So, 3 ( 6 × 3 1 0 + 5 ) ≡ 3 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If n ≡ 4 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 4 ( 6 × 4 1 0 + 5 ) . 4 1 0 ≡ 2 2 0 ≡ 1 ( m o d 1 1 ) (from case 3). So, 4 ( 6 × 3 1 0 + 5 ) ≡ 4 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If n ≡ 5 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 5 ( 6 × 5 1 0 + 5 ) . As 5 2 ≡ 3 ( m o d 1 1 ) , 5 1 0 ≡ 3 5 ≡ 1 ( m o d 1 1 ) (from case 4). So, 5 ( 6 × 5 1 0 + 5 ) ≡ 5 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If n ≡ 6 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 6 ( 6 × 6 1 0 + 5 ) . 6 1 0 ≡ 2 1 0 × 3 1 0 ≡ 1 ( m o d 1 1 ) (from case 3 and 4). So, 6 ( 6 × 6 1 0 + 5 ) ≡ 6 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If n ≡ 7 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 7 ( 6 × 7 1 0 + 5 ) . As 7 3 ≡ 2 ( m o d 1 1 ) . 7 1 0 ≡ 2 3 × 7 ≡ 5 6 ≡ 1 ( m o d 1 1 ) . So, 7 ( 6 × 6 1 0 + 5 ) ≡ 7 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If n ≡ 8 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 8 ( 6 × 8 1 0 + 5 ) . 8 1 0 ≡ 2 3 0 ≡ 1 ( m o d 1 1 ) (from case 3). So, 8 ( 6 × 8 1 0 + 5 ) ≡ 8 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If n ≡ 9 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 9 ( 6 × 9 1 0 + 5 ) . 9 1 0 ≡ 3 2 0 ≡ 1 ( m o d 1 1 ) (from case 4). So, 9 ( 6 × 9 1 0 + 5 ) ≡ 9 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
If If n ≡ 1 0 ≡ − 1 ( m o d 1 1 ) , n ( 6 n 1 0 + 5 ) ≡ 1 0 ( 6 × 1 0 1 0 + 5 ) 1 0 1 0 ≡ − 1 1 0 ≡ 1 ( m o d 1 0 ) . So, 1 0 ( 6 × 1 0 1 0 + 5 ) ≡ 1 0 ( 6 + 5 ) ≡ 0 ( m o d 1 1 )
Thus we conclude that n ( 6 n 1 0 + 5 ) is divisible by 11 for all n.
Thus, 6 n 1 1 + 3 3 n 1 0 + 5 5 n 9 − 6 6 n 7 + 6 6 n 5 − 3 3 n 3 + 5 n is divisible by 66 for all n.
Phew!!!