Difference between revisions of "2005 Canadian MO Problems/Problem 5"
(Categorization) |
(→Solution) |
||
(7 intermediate revisions by 5 users not shown) | |||
Line 7: | Line 7: | ||
==Solution== | ==Solution== | ||
+ | |||
+ | {{solution}} | ||
+ | |||
+ | Partial Solution: | ||
+ | |||
+ | Consider <math>P(x)=(x-a)(x-b)(x-c)</math>. | ||
+ | Let <math>S_k= a^k+b^k+c^k</math>. | ||
+ | |||
+ | According to Newton’s Sum: | ||
+ | |||
+ | <math>S_{k+3}-(a+b+c)S_{k+2}+(ab+bc+ca)S_{k+1}-(abc)S_k=0</math>. | ||
+ | So clearly if <math>a+b+c \vert S_k, S_{k+1},</math> then <math>a+b+c \vert S_{k+3}</math>. | ||
+ | This proves (b). | ||
==See also== | ==See also== | ||
− | |||
*[[2005 Canadian MO]] | *[[2005 Canadian MO]] | ||
+ | {{CanadaMO box|year=2005|num-b=4|after=Last Question}} | ||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] |
Latest revision as of 17:21, 28 November 2023
Problem
Let's say that an ordered triple of positive integers is -powerful if , , and is divisible by . For example, is 5-powerful.
- Determine all ordered triples (if any) which are -powerful for all .
- Determine all ordered triples (if any) which are 2004-powerful and 2005-powerful, but not 2007-powerful.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
Partial Solution:
Consider . Let .
According to Newton’s Sum:
. So clearly if then . This proves (b).
See also
2005 Canadian MO (Problems) | ||
Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 | Followed by Last Question |