Difference between revisions of "2006 AIME I Problems/Problem 13"
m |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
For each even positive integer <math> x, </math> let <math> g(x) </math> denote the greatest power of 2 that divides <math> x. </math> For example, <math> g(20)=4 </math> and <math> g(16)=16. </math> For each positive integer <math> n, </math> let <math> S_n=\sum_{k=1}^{2^{n-1}}g(2k). </math> Find the greatest integer <math> n </math> less than 1000 such that <math> S_n </math> is a perfect square. | For each even positive integer <math> x, </math> let <math> g(x) </math> denote the greatest power of 2 that divides <math> x. </math> For example, <math> g(20)=4 </math> and <math> g(16)=16. </math> For each positive integer <math> n, </math> let <math> S_n=\sum_{k=1}^{2^{n-1}}g(2k). </math> Find the greatest integer <math> n </math> less than 1000 such that <math> S_n </math> is a perfect square. | ||
| + | |||
| + | |||
| + | |||
| + | |||
== Solution == | == Solution == | ||
| + | |||
| + | |||
| + | |||
== See also == | == See also == | ||
| − | * [[2006 AIME I]] | + | * [[2006 AIME I Problems]] |
Revision as of 11:15, 30 June 2006
Problem
For each even positive integer 
let 
denote the greatest power of 2 that divides 
For example, 
and 
For each positive integer 
let 
Find the greatest integer 
less than 1000 such that 
is a perfect square.
