q + q 2 + ⋯ + q 7 7 2 ≡ 0 ( m o d 7 7 3 )
For how many integers q with 1 < q < 7 7 3 does the above hold true?
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.
What happens to q-1?
Log in to reply
Since ( q − 1 ) ( q + q 2 + . . . . + q 7 7 2 ) = q ( q 7 7 2 − 1 ) , we know that if q + q 2 + . . . . + q 7 7 2 ≡ 0 ( m o d 7 7 3 ) then so must q ( q 7 7 2 − 1 ) ≡ 0 ( m o d 7 7 3 ) , regardless of what q − 1 is equal to.
Problem Loading...
Note Loading...
Set Loading...
We first note that q + q 2 + . . . . + q 7 7 2 = q ( 1 + q + . . . + q 7 7 1 ) = q × q − 1 q 7 7 2 − 1 . Thus we are looking for 1 < q < 7 7 3 such that q ( q 7 7 2 − 1 ) ≡ 0 ( m o d 7 7 3 ) .
But since 7 7 3 is prime, by Fermat's Little Theorem we know that q 7 7 2 ≡ 1 ( m o d 7 7 3 ) ⟹ q 7 7 2 − 1 ≡ 0 ( m o d 7 7 3 ) ⟹ q ( q 7 7 2 − 1 ) ≡ 0 ( m o d 7 7 3 )
for all q from 2 to 7 7 2 , and so the answer is 7 7 2 − 2 + 1 = 7 7 1 .