{"status": "success", "data": {"description_md": "For each even positive integer $x$, let $g(x)$ denote the greatest power of $2$ that divides $x$. For example, $g(20)=4$ and $g(16)=16$. For each positive integer $n$, let $S_n=\\sum_{k=1}^{2^{n-1}}g(2k).$ Find the greatest integer $n$ less than $1000$ such that $S_n$ is a perfect square.\n___\nLeading zeroes must be inputted, so if your answer is `34`, then input `034`. Full credit goes to [MAA](https://maa.org/) for authoring these problems. These problems were taken on the [AOPS](https://artofproblemsolving.com/) website.", "description_html": "

For each even positive integer x, let g(x) denote the greatest power of 2 that divides x. For example, g(20)=4 and g(16)=16. For each positive integer n, let S_n=\\sum_{k=1}^{2^{n-1}}g(2k). Find the greatest integer n less than 1000 such that S_n is a perfect square.

Leading zeroes must be inputted, so if your answer is 34, then input 034. Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.

", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 6, "problem_name": "2006 AIME I Problem 13", "can_next": true, "can_prev": true, "nxt": "/problem/06_aime_I_p14", "prev": "/problem/06_aime_I_p12"}}