olymmath

PE-MO 2015 Problem 3

    Let a1,a2,...,ana_1, a_2, . . . , a_n be positive integers, with n≥2n \ge 2 , such that ⌊a1⋅a2⋅⋅⋅an⌋=⌊a1⌋⋅⌊a2⌋⋅⋅⋅⌊an⌋.\lfloor \sqrt{a_1 \cdot a_2\cdot\cdot\cdot a_n} \rfloor = \lfloor \sqrt{a_1} \rfloor \cdot \lfloor \sqrt{a_2} \rfloor \cdot\cdot\cdot \lfloor \sqrt{a_n} \rfloor. Prove that at least n−1n - 1 of these numbers are perfect squares.

    Clarification: Given a real number xx , ⌊x⌋\lfloor x\rfloor denotes the largest integer that is less than or equal to xx . For example ⌊2⌋\lfloor \sqrt2\rfloor and ⌊3⌋=3\lfloor 3\rfloor =3 .

    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 pe-mo/2015/p3 · Tag R86VBFVAHQ · Edit this page on GitHub · Keys: j next, k previous