Difference between revisions of "2002 AIME I Problems/Problem 9"
(→Problem) |
m (→See also) |
||
| Line 14: | Line 14: | ||
== See also == | == See also == | ||
| − | + | {{AIME box|year=2002|n=I|num-b=8|num-a=10}} | |
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 14:14, 25 November 2007
Problem
Harold, Tanya, and Ulysses paint a very long picket fence.
Harold starts with the first picket and paints every 
th picket;
Tanya starts with the second picket and paints every 
th picket; and
Ulysses starts with the third picket and paints every 
th picket.
Call the positive integer 
paintable when the triple 
of positive integers results in every picket being painted exaclty once. Find the sum of all the paintable integers.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2002 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 8 |
Followed by Problem 10 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
