Difference between revisions of "1996 AIME Problems/Problem 2"
m (tex) |
(→Solution) |
||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | For integers <math>k</math>, we want <math>\lfloor \log_2 n\rfloor = 2k</math>, or <math>2k \le \log_2 < 2k+1 \Longrightarrow 2^{2k} \le n < 2^{2k+1}</math>. Thus, <math>n</math> must satisfy these [[inequality|inequalities]] (since <math>n < 1000</math>): | + | For integers <math>k</math>, we want <math>\lfloor \log_2 n\rfloor = 2k</math>, or <math>2k \le \log_2 n < 2k+1 \Longrightarrow 2^{2k} \le n < 2^{2k+1}</math>. Thus, <math>n</math> must satisfy these [[inequality|inequalities]] (since <math>n < 1000</math>): |
<div style="text-align:center;"> | <div style="text-align:center;"> |
Revision as of 18:28, 12 March 2009
Problem
For each real number , let
denote the greatest integer that does not exceed x. For how many positive integers
is it true that
and that
is a positive even integer?
Solution
For integers , we want
, or
. Thus,
must satisfy these inequalities (since
):
![$256\leq n<512$](http://latex.artofproblemsolving.com/1/2/5/12583c0de231821c8da555fdbffec957189ea6a9.png)
There are for the first inequality,
for the second,
for the third, and
for the fourth, so the answer is
.
See also
1996 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |