For a given integer n≥2, let {a1,a2,…,am} be the set of positive integers less than n that are relatively prime to n. Prove that if every prime that divides m also divides n, then a1k+a2k+⋯+amk is divisible by m for every positive integer k. Proposed by Ivan Borsenco USAMO2018 USAMO Problem 3number theoryHi