Enormous product of primes

Number Theory Level pending

Let p 1 = 2 , p 2 = 3 , p 3 = 5 , p 4 = 7 , . . . p_1=2, p_2=3, p_3=5, p_4=7,... be the primes. Compute ( 65537 p 1 ) ( 65537 p 2 ) . . . ( 65537 p 10000 ) m o d 65537 (65537-p_1)(65537-p_2)...(65537-p_{10000}) \mod 65537


The answer is 0.

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

Alex Li
Jul 9, 2015

Note that 65537 = 2 16 + 1 65537=2^{16}+1 , which is a well-known Fermat prime. A quick search will reveal that there are 9592 9592 primes less than 100000 100000 , so one of the primes used will be 65537 65537 , which makes the whole product 0 \boxed{0} .

Moderator note:

There's a simpler way to prove that the 10000th prime number is larger than 65537.

Hint : Prime Number Theorem.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...