Divisible by Seven

How many integers exist in the interval 0 < n < 1000 0 < n < 1000 , such that 1 n + 2 n + 4 n 1^n + 2^n + 4^n is divisible by 7?


The answer is 666.

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

Ankit Nigam
May 4, 2016

2 n 2 , 4 , 1 ( m o d 7 ) 2^n \equiv 2, 4, 1 \pmod{7}

4 n 4 , 2 , 1 ( m o d 7 ) 4^n \equiv 4, 2, 1 \pmod{7}

1 n 1 , 1 , 1 ( m o d 7 ) 1^n \equiv 1, 1, 1 \pmod{7}

4 n + 2 n + 1 n 0 , 0 , 3 ( m o d 7 ) \therefore 4^n + 2^n + 1^n \equiv 0, 0, 3 \pmod{7}

Clearly 4 n + 2 n + 1 n 4^n + 2^n + 1^n is a not multiple of 7 7 whenever n n is multiple of 3 3

So subtract number of multiples of 3 3 in the range 1 n 999 1 \le n \le 999 i.e. 333 333

999 333 = 666 \therefore 999 - 333 = \boxed{666} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...