Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Math+CS guru? Prove this conjecture.
The only element of the sum that can be odd is when p = k. This element is prime(0), which is 0 because 0 is not prime.
Thus, the overall sum is necessarily even.
It is easy to check that this sum is strictly larger than 2. Thus, it cannot be a prime number.
What is this conjecture for?
There are no comments on this comment yet.
The only element of the sum that can be odd is when p = k. This element is prime(0), which is 0 because 0 is not prime.
Thus, the overall sum is necessarily even.
It is easy to check that this sum is strictly larger than 2. Thus, it cannot be a prime number.
What is this conjecture for?