0

Q.To show that the number $N=(P_1....P_n)+1$ is not always prime (where $P_1,...,P_n$)are the first n primes) , find an n for which $(P_1...P_n)+1$ is not prime

My attempt

since $P_1,...,P_n$are the first n primes so $P_1=2$

so product is even so N is odd number

$N=2k+1$

since odd number {1,3,5,7,9,....} is not always prime so N is not always prime

Cettt
  • 2,494

2 Answers2

1

$2\cdot3\cdot5\cdot7\cdot11\cdot13+1=30,031=59\cdot509$

user404127
  • 792
  • 4
  • 7
1

The number $N=p_1\cdots p_n+1$ is often prime, for the first $n$ primes $p_i$, but not always. The first example is $$ N=2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13+1=30031=59\cdot 509. $$ The next one is $$ N=2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13\cdot 17+1=19 \cdot 97\cdot 277. $$

Edit: We will not obtain all odd numbers by this (as remarked by Michael, and user190080 in his answer, unfortunately deleted now).

Dietrich Burde
  • 130,978
  • I just deleted mine and upvoted yours, maybe you could add the information, why the attempt of the OP doesn't work... – user190080 Jan 10 '17 at 16:04