olymmath

IL-GROSSMAN 1999 Problem 1

    For any 1616 positive integers n,a1,a2,...,a15n,a_1,a_2,...,a_{15} we define T(n,a1,a2,...,a15)=(a1n+a2n+...+a15n)a1a2...a15T(n,a_1,a_2,...,a_{15}) = (a_1^n+a_2^n+ ...+a_{15}^n)a_1a_2...a_{15} . Find the smallest nn such that T(n,a1,a2,...,a15)T(n,a_1,a_2,...,a_{15}) is divisible by 1515 for any choice of a1,a2,...,a15a_1,a_2,...,a_{15} .

    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 il-grossman/1999/p1 · Tag BXW54XQ958 · Edit this page on GitHub · Keys: j next, k previous