hey everyone , i need your help about this exercice , i coudn't find the solution    ''write a program in php console which finds the largest sequence of prime numbers such as their sum and product is a prime number ''

Spoiler

Spoiler

 

 

 

1 hour ago, jonas garden said:

 ''write a program in php console which finds the largest sequence of prime numbers such as their sum and product is a prime number ''

Are you sure about the formulation? If you multiply primes from a sequence of primes how could the result be a prime number? 
 

 

Just now, Ghideon said:

Are you sure about the formulation? If you multiply primes from a sequence of primes how could the result be a prime number? 
 

 

YES , wait and if we will say sum/product

1 hour ago, jonas garden said:

YES , wait and if we will say sum/product

Sorry, that is not very clear. Please explain, preferably with an example.

There is something about the exercise formulation I do not understand. Two primes A and B have the product C=A*B. The product, C, can't be a prime.

 

The modulus operator is the barebones method of determining prime numbers.

Keyword search: modulus operator prime.

There is a wealth of knowledge plastered across the internet on the topic.