BALKAN-SL 2019 N2
Let be a nonempty set, where is a positive integer. We denote by the greatest common divisor of the elements of the set . We assume that and let be its smallest divisor greater than . Let be a set such that and . Prove that the greatest common divisor of the elements in is .
[Second Version] Let be a positive integer and . Let be a nonempty subset of and let be the smallest common divisor of all elements of the set . Find the smallest positive integer such that for any subset of , consisting of elements, with , the greatest common divisor of all elements of is equal to .
Dataset text AI-MO AoPS. 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.