olymmath

CMO 2014 Problem 4

  • Day 2

Let n=p1a1p2a2⋯ptatn=p_1^{a_1}p_2^{a_2}\cdots p_t^{a_t} be the prime factorisation of nn . Define ω(n)=t\omega(n)=t and Ω(n)=a1+a2+…+at\Omega(n)=a_1+a_2+\ldots+a_t . Prove or disprove: For any fixed positive integer kk and positive reals α,β\alpha,\beta , there exists a positive integer n>1n>1 such that i) ω(n+k)ω(n)>α\frac{\omega(n+k)}{\omega(n)}>\alpha ii) Ω(n+k)Ω(n)<β\frac{\Omega(n+k)}{\Omega(n)}<\beta .

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