olymmath

CMO 2005 Problem 5

  • Paper
  • Answer

Let's say that an ordered triple of positive integers (a,b,c)(a, b, c) is nn-powerful if a≤b≤ca \leq b \leq c, gcd⁡(a,b,c)=1\operatorname{gcd}(a, b, c)=1, and an+bn+cna^{n}+b^{n}+c^{n} is divisible by a+b+ca+b+c. For example, (1,2,2)(1,2,2) is 5 -powerful.

a) Determine all ordered triples (if any) which are nn-powerful for all n≥1n \geq 1.

b) Determine all ordered triples (if any) which are 2004-powerful and 2005-powerful, but not 2007-powerful.

[Note that gcd⁡(a,b,c)\operatorname{gcd}(a, b, c) is the greatest common divisor of a,ba, b and cc.]

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

(1,1,1) \text{ and } (1,1,4)

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

Locator ca-cmo/2005/p5 · Tag 9CTP8VG9TD · Edit this page on GitHub · Keys: j next, k previous