olymmath

JBMO 2002 Problem 3

  • Paper

Find all positive integers which have exactly 16 positive divisors 1=d1<d2<…<d16=n1 = d_1 < d_2 < \ldots < d_{16} =n such that the divisor dkd_k , where k=d5k = d_5 , equals (d2+d4)d6(d_2 + d_4) d_6 .

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 jbmo/2002/p3 · Tag J2JDNKBN7G · Edit this page on GitHub · Keys: j next, k previous