Small-representative conjecture for sum-product pairs
Statement
Let
where
Small-representative conjecture. If , then there is a set with
and
This conjecture bounds the largest element needed to realize any sum-product pair of cardinality . The source motivates the bound from its computational dataset and gives no proof or disproof.
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.