The parity-product conjecture for maximal heights of square-free divisors
Statement
Let be square-free, and let denote the number of primes dividing . The parity-product conjecture. is attained by at least one of the two polynomials
or
The conjecture is true when and , and the source reported computational support for the listed cases. Its validity for general square-free remained 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.