olymmath

ILL 1967 Problem 2

    Prove that 13n2+12n+16≥(n!)2n,\frac{1}{3}n^2 + \frac{1}{2}n + \frac{1}{6} \geq (n!)^{\frac{2}{n}},

    and let n≥1n \geq 1 be an integer. Prove that this inequality is only possible in the case n=1.n = 1.

    Dataset text AoPS wiki problems. 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 ill/1967/p2 · Tag PH9CMYS66R · Edit this page on GitHub · Keys: j next, k previous