Sierpiński's conjecture on primes in rows of an n by n matrix
Statement
Let be an integer. Arrange the integers in an matrix, with row consisting of the integers :
Sierpiński's conjecture. Every row of this matrix contains at least one prime number.
This is presented as a beautiful problem and is attributed by the source to Ribenboim; no resolution is given in the paper.
Record
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.