Difference between revisions of "2000 AIME II Problems/Problem 12"
m |
|||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
+ | Given a function <math>f</math> for which | ||
+ | <center><math>f(x) = f(398 - x) = f(2158 - x) = f(3214 - x)</math></center> | ||
+ | holds for all real <math>x,</math> what is the largest number of different values that can appear in the list <math>f(0),f(1),f(2),\ldots,f(999)</math>? | ||
== Solution == | == Solution == | ||
+ | {{solution}} | ||
== See also == | == See also == | ||
− | + | {{AIME box|year=2000|n=II|num-b=11|num-a=13}} |
Revision as of 18:14, 11 November 2007
Problem
Given a function for which
holds for all real what is the largest number of different values that can appear in the list ?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
2000 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |