Sweet 17

Let x x be any positive integer greater than 1 7 17 17^{17} , which is not divisible by 17 17 .

Then which of the following is always true :

A: either x 8 1 x^8-1 , or x 8 + 1 x^8+1 , is divisible by 17 17 .

B: either x 9 1 x^9-1 , or x 9 + 1 x^9+1 , is divisible by 17 17 .

C: either x 8 1 x^8-1 , or x 9 + 1 x^9+1 , is divisible by 17 17 .

D: either x 8 + 1 x^8+1 , or x 9 1 x^9-1 , is divisible by 17 17 .

D C A B

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.

1 solution

Danish Ahmed
Jan 15, 2015

The answer is A A .

let the number be x = 17 k + r x = 17k+r with 1 < = r < = 16 1<=r<=16 then ( 17 k + r ) 8 (17k+r)^8 mod 17 17 is congruent to r 8 r^8 mod 17 17 now for r = 1 r=1 through 16 16 , r 8 r^8 mod 17 17 is either 1 1 or 16 16 (easily verified by direct calculation)

r r : r 8 r^8 mod 17 17

1 : 1

2 : 1

3 : 16

4 : 1

5 : 16

6 : 16

7 : 16

8 : 1

9 : 1

10 : 16

11 : 16

12 : 16

13 : 1

14 : 16

15 : 1

16 : 1

thus in every case either r 8 1 r^8-1 or r 8 1 r^8-1 is congruent to 0 0 mod 17 17 , thus in every case either x 8 + 1 x^8+1 or x 8 1 x^8-1 is divisible by 17 17

17 x 16 1 = ( x 8 + 1 ) ( x 8 1 ) \displaystyle 17|x^{16}-1=(x^8+1)(x^8-1) .

Satvik Golechha - 6 years, 4 months ago

Log in to reply

By Fermat's little theorem, yes :)

Jake Lai - 6 years, 4 months ago

That's how I solved it ^^.

Sudeshna Pontula - 6 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...