ILL 1978 Problem 23
Let be the set of all the odd positive integers that are not multiples of and that are less than , being an arbitrary positive integer. What is the smallest integer such that in any subset of integers from there must be two different integers, one of which divides the other?
Dataset text AoPS wiki problems. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.