Difference between revisions of "2002 AIME II Problems/Problem 8"
I like pie (talk | contribs) m |
I like pie (talk | contribs) (Added problem, solution still needed) |
||
| Line 1: | Line 1: | ||
| − | |||
== Problem == | == Problem == | ||
| + | Find the least positive integer <math>k</math> for which the equation <math>\left\lfloor\frac{2002}{n}\right\rfloor=k</math> has no integer solutions for <math>n</math>. (The notation <math>\lfloor x\rfloor</math> means the greatest integer less than or equal to <math>x</math>.) | ||
== Solution == | == Solution == | ||
Revision as of 13:05, 19 April 2008
Problem
Find the least positive integer 
for which the equation 
has no integer solutions for 
. (The notation 
means the greatest integer less than or equal to 
.)
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2002 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 7 |
Followed by Problem 9 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
