Selfridge's conjecture
Statement
Call an odd natural number a Sierpi'nski number if every member of the set
is composite, i.e. is composite for all positive integers .
Then is a Sierpi'nski number, and it is the smallest one: for every odd integer with there exists a positive integer such that is prime.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.