olymmath

CN-TST 2017 Problem 7

  • Test 2

Let nn be a positive integer. Let DnD_n be the set of all divisors of nn and let f(n)f(n) denote the smallest natural mm such that the elements of DnD_n are pairwise distinct in mod mm . Show that there exists a natural NN such that for all n≥Nn \geq N , one has f(n)≤n0.01f(n) \leq n^{0.01} .

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 cn-tst/2017/p7 · Tag KZ9H816ZPE · Edit this page on GitHub · Keys: j next, k previous