Ramaekers's strong n-conjecture
Statement
Let . For an -tuple with nonzero entries, write
and for a sequence of such tuples write . Let be the set of -tuples satisfying the stated sum, subsum, and pairwise-coprimality conditions. Ramaekers's conjecture. For every , .
This is a strong generalisation of the -conjecture. The paper's abstract states that the conjecture is false for every , while the case is equivalent to the -conjecture.
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.