A number theory problem by Anandmay Patel

Let P i P_i denote the i th i^\text{th} smallest prime number .
Can ( j = 1 m P j ) + 1 = 2 × 3 × 5 × × P m + 1 \displaystyle \left(\prod_{j=1}^m P_j \right) + 1 = 2\times3\times5\times \cdots \times P_m + 1 ever be a prime number?

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

Anandmay Patel
Aug 7, 2016

The given number can either be a prime number OR can be a number having divisors greater than the 'm'th prime number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...