Find the number of all positive integers n ≤ 2 0 1 7 such that
7 ∣ n 2 + n + 1
Note: Avoid the use of computer programming. Otherwise you will not get the fun.
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.
I have a doubt
n 3 − 1 ≡ 0 ( m o d 7 )
If n = 8 then n 3 − 1 is divisible by 7 .But n 2 + n + 1 is not divisible by 7.
So, in your calculation there may be some solutions which are not allowable.
Log in to reply
@Kushal Bose You are right but this answer escapes that as $n$ is not congruent to 1 modulo 7.
Log in to reply
Ohh Thanks.I missed out that
Log in to reply
@Kushal Bose – There would be another 2 8 9 integers n between 1 and 2 0 1 7 with n ≡ 1 ( m o d 7 ) , but n 2 + n + 1 ≡ 3 ( m o d 7 ) for each of those.
Why didn't you just verify directly that n 2 + n = 1 ≡ 0 ( m o d 7 ) ⇔ n ≡ 2 , 4 ( m o d 7 ) ?
What benefits do we get by looking at n 3 − 1 ?
Log in to reply
By looking at n 3 − 1 , we can think about cube roots of units modulo 7 . We can then consider that the nonzero numbers in Z 7 form a cyclic group of order 6 , with generator 3 , and hence the cube roots of unity (modulo 7 ) are the even powers of 3 , namely 1 , 2 , 4 , so the roots we want are 2 , 4 (modulo 7 ).
If we just solve the congruence n 2 + n + 1 ≡ 0 ( m o d 7 ) by hand, we miss the chance to see how this problem could be extended, so that we can solve equations of the form n a + n a − 1 + ⋯ + n + 1 ≡ 0 ( m o d p ) for positive integers a and primes p .
observe that only the numbers of the form 7x+2,7x+4 can be plugged in to n and divide by 7. from both we have 288 options therefore: 288×2=576
Problem Loading...
Note Loading...
Set Loading...
Since ( n − 1 ) ( n 2 + n + 1 ) = n 3 − 1 , we want to find integers 1 ≤ n ≤ 2 0 1 7 such that n 3 ≡ 1 ( m o d 7 ) but n ≡ 1 ( m o d 7 ) , namely numbers such that n ≡ 2 , 4 ( m o d 7 ) . Since 2 0 1 7 = 7 × 2 8 8 + 1 , we deduce that there are 2 × 2 8 8 = 5 7 6 such numbers.