The most general divisor-set conjecture
Statement
Let be a positive integer, and let divisibility of a product mean that each integer in divides that product. The most general divisor-set conjecture. For every , there exists a set of size , with each of size , such that
The paper presents this as a more general variation of the preceding structured conjectures, while noting that it is not currently known how to turn it into algorithms. No resolution evidence is supplied.
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.