DK-GEORGMOHR 2004 Problem 2
Show that if and are integer numbers, and is divisible by , then divisible by .
Dataset text AI-MO AoPS. Quoted with source.
Official text: Georg Mohr Contest 2004 official paper, page 1.
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.