The converse as a conjecture
Statement
For an integer , let
denote the congruence between the binomial coefficient and modulo , where is a positive integer.
For every integer such that
the number is prime. Equivalently, no composite integer satisfies .
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.