Difference between revisions of "1985 AIME Problems/Problem 10"

m
m
Line 4: Line 4:
 
<math>\lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor</math>,
 
<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>?
+
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}}
 
{{solution}}
Line 11: Line 11:
 
* [[1985 AIME Problems/Problem 11 | Next problem]]
 
* [[1985 AIME Problems/Problem 11 | Next problem]]
 
* [[1985 AIME Problems]]
 
* [[1985 AIME Problems]]
 +
* [[Floor function]]

Revision as of 21:06, 19 November 2006

Problem

How many of the first 1000 positive integers can be expressed in the form

$\lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor$,

where $x$ is a real number, and $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$?

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also