CONO-SUR 2016 Problem 6
We say that three different integers are friendly if one of them divides the product of the other two. Let be a positive integer.
a) Show that, between and , exclusive, does not exist any triplet of friendly numbers.
b) Determine if for each exists a triplet of friendly numbers between and , exclusive.
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.