1996 AIME Problem 2

Attempt Problem 2 of the 1996 AIME below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1996 AIME solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

2.

For each real number x,x, let x\lfloor x\rfloor denote the greatest integer that does not exceed x.x. For how many positive integers nn is it true that n<1000n<1000 and that log2n\lfloor\log_2 n\rfloor is a positive even integer?

Answer: 340
Concepts:floor and ceiling functionslogarithmcounting integers in a range
Difficulty rating: 1740
Small Hint:

Translate each possible value of log2n\lfloor\log_2n\rfloor into a power-of-two interval

Big Hint:

The possible even values below 10001000 are 2,2, 4,4, 6,6, and 88

Solution:

If log2n=k,\lfloor\log_2n\rfloor=k, then 2kn<2k+1.2^k\leq n<2^{k+1}. The value of kk can be 2,2, 4,4, 6,6, or 8,8, since 210>1000.2^{10}>1000. The corresponding interval sizes are 22,2^2, 24,2^4, 26,2^6, and 28.2^8. Therefore the requested number is 4+16+64+256=340.4+16+64+256=340.

← Problem 1#1
Full Exam

Problem 2 in Other Years