MathDB
Abc divides (a+b+c)^(n^2+n+1)

Source: 3rd QEDMO 2006, problem 2, generalizing Norway (Abel) 1998-99 final problem 2b

April 14, 2006
number theorynumber theory proposed

Problem Statement

Let a a, b b, c c and n n be positive integers such that an a^n is divisible by b b, such that bn b^n is divisible by c c, and such that cn c^n is divisible by a a. Prove that \left(a \plus{} b \plus{} c\right)^{n^2 \plus{} n \plus{} 1} is divisible by abc abc. An even broader generalization, though not part of the QEDMO problem and not quite number theory either: If u u and n n are positive integers, and a1 a_1, a2 a_2, ..., au a_u are integers such that ain a_i^n is divisible by a_{i \plus{} 1} for every i i such that 1iu 1\leq i\leq u (we set a_{u \plus{} 1} \equal{} a_1 here), then show that \left(a_1 \plus{} a_2 \plus{} ... \plus{} a_u\right)^{n^{u \minus{} 1} \plus{} n^{u \minus{} 2} \plus{} ... \plus{} n \plus{} 1} is divisible by a1a2...au a_1a_2...a_u.