True or false :
2 1 2 3 4 5 6 7 8 9 × 3 2 4 6 9 1 3 5 7 8 − 1 is divisible by 17.
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.
Or by modulo arithmetic:
2
n
×
3
2
n
−
1
=
1
8
n
−
1
≡
1
n
−
1
=
0
(
mod
1
7
)
Log in to reply
You are right too.
Log in to reply
And actually I did not realize the 1 : 2 when I was doing it. I used Euler's theorem......
Problem Loading...
Note Loading...
Set Loading...
For any positive integer n , 2 n ∗ 3 2 n − 1 is always divisibile by 17. We can prove that by induction.