Difference between revisions of "1986 AIME Problems/Problem 5"
(→Solution: synthetic substitution) |
I_like_pie (talk | contribs) (→See also) |
||
Line 7: | Line 7: | ||
== See also == | == See also == | ||
− | |||
− | |||
{{AIME box|year=1986|num-b=4|num-a=6}} | {{AIME box|year=1986|num-b=4|num-a=6}} | ||
+ | * [[AIME Problems and Solutions]] | ||
+ | * [[American Invitational Mathematics Examination]] | ||
+ | * [[Mathematics competition resources]] | ||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] |
Revision as of 13:40, 6 May 2007
Problem
What is that largest positive integer for which is divisible by ?
Solution
If , . Using the Euclidean algorithm, we have , so must divide 900. The greatest integer for which divides 900 is 890; we can double-check manually and we find that indeed .
In a similar manner, we can apply synthetic substitution. We are looking for . Again, must be a factor of .
See also
1986 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |