Conjecture on primes with no minimal monomial solutions of size 2 modulo 4
Statement
For a prime , consider the nonzero minimal monomial solutions associated with , and let their size be the corresponding integer size. The prime classification conjecture. The only primes for which every nonzero minimal monomial solution has size not congruent to modulo are
The claim is motivated by a computational search through all primes below , which found precisely these primes; whether the list is complete remains open.
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.