Geometric Sum Modulo a Prime

q + q 2 + + q 772 0 ( m o d 773 ) q+q^2+\cdots +q^{772} \equiv 0 \pmod{773}

For how many integers q q with 1 < q < 773 1<q< 773 does the above hold true?


The answer is 771.

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

We first note that q + q 2 + . . . . + q 772 = q ( 1 + q + . . . + q 771 ) = q × q 772 1 q 1 q + q^{2} + .... + q^{772} = q(1 + q + ... + q^{771}) = q \times \dfrac{q^{772} - 1}{q - 1} . Thus we are looking for 1 < q < 773 1 \lt q \lt 773 such that q ( q 772 1 ) 0 ( m o d 773 ) q(q^{772} - 1) \equiv 0 \pmod{773} .

But since 773 773 is prime, by Fermat's Little Theorem we know that q 772 1 ( m o d 773 ) q 772 1 0 ( m o d 773 ) q ( q 772 1 ) 0 ( m o d 773 ) q^{772} \equiv 1 \pmod{773} \Longrightarrow q^{772} - 1 \equiv 0 \pmod{773} \Longrightarrow q(q^{772} - 1) \equiv 0 \pmod{773}

for all q q from 2 2 to 772 772 , and so the answer is 772 2 + 1 = 771 772 - 2 + 1 = \boxed{771} .

What happens to q-1?

vikas venkatraman - 2 years, 10 months ago

Log in to reply

Since ( q 1 ) ( q + q 2 + . . . . + q 772 ) = q ( q 772 1 ) (q - 1)(q + q^{2} + .... + q^{772}) = q(q^{772} - 1) , we know that if q + q 2 + . . . . + q 772 0 ( m o d 773 ) q + q^{2} + .... + q^{772} \equiv 0 \pmod{773} then so must q ( q 772 1 ) 0 ( m o d 773 ) q(q^{772} - 1) \equiv 0 \pmod{773} , regardless of what q 1 q - 1 is equal to.

Brian Charlesworth - 2 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...