Difference between revisions of "1985 AIME Problems/Problem 10"
(→See also) |
m |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | How many of the first 1000 [[positive integer]]s can be expressed in the form | ||
| + | <math>\lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor</math>, | ||
| + | |||
| + | where <math>x</math> is a [[real number]], and <math>\lfloor z \rfloor</math> denotes the greatest [[integer less]] than or equal to <math>z</math>? | ||
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
== See also == | == See also == | ||
| + | * [[1985 AIME Problems/Problem 9 | Previous problem]] | ||
| + | * [[1985 AIME Problems/Problem 11 | Next problem]] | ||
* [[1985 AIME Problems]] | * [[1985 AIME Problems]] | ||
Revision as of 21:05, 19 November 2006
Problem
How many of the first 1000 positive integers can be expressed in the form
,
where 
is a real number, and 
denotes 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.
