MathDB
Turkey Junior Olympiad 2000, Part II - P2

Source:

January 18, 2013
modular arithmetic

Problem Statement

Find the least positive integer nn such that 1515 divides the product a1a2a15(a1n+a2n++a15n)a_1a_2\dots a_{15}\left (a_1^n+a_2^n+\dots+a_{15}^n \right ) , for every positive integers a1,a2,,a15a_1, a_2, \dots, a_{15}.