olymmath

UA-UMO 2005 Problem 103

  • Grade 10

An integer n>101n>101 is divisible by 101101 . Suppose that every divisor dd of nn with 1<d<n1<d<n equals the difference of two divisors of nn . Prove that nn is divisble by 100100 .

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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ua-umo/2005/p103 · Tag 1YZJ17XVN5 · Edit this page on GitHub · Keys: j next, k previous