olymmath

SCHWEITZER 2007 Problem 3

    Denote by ω(n)\omega (n) the number of prime divisors of the natural number nn (without multiplicities). Let F(x)=max⁡n≤xω(n)            G(x)=max⁡n≤x(ω(n)+ω(n2+1))F(x)=\max_{n\leq x} \omega (n) \,\,\,\,\,\,\,\,\,\,\,\, G(x)=\max_{n\leq x} \left( \omega (n) + \omega (n^2+1)\right) Prove that G(x)−F(x)→∞G(x)-F(x)\to \infty as x→∞x\to\infty .

    (translated by Miklós Maróti)

    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 schweitzer/2007/p3 · Tag 5P9SAA8PFK · Edit this page on GitHub · Keys: j next, k previous