olymmath

CN-TST 2014 Problem 18

  • Test 3

For positive integer k>1k>1 , let f(k)f(k) be the number of ways of factoring kk into product of positive integers greater than 11 (The order of factors are not countered, for example f(12)=4f(12)=4 , as 1212 can be factored in these 44 ways: 12,2⋅6,3⋅4,2⋅2⋅312,2\cdot 6,3\cdot 4, 2\cdot 2\cdot 3 . Prove: If nn is a positive integer greater than 11 , pp is a prime factor of nn , then f(n)≤npf(n)\leq \frac{n}{p}

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/2014/p18 · Tag TQ0DVC6MTF · Edit this page on GitHub · Keys: j next, k previous