{"status": "success", "data": {"description_md": "Find the largest integer $k$ for which $2^k$ divides $59!$", "description_html": "<p>Find the largest integer <span class=\"katex--inline\">k</span> for which <span class=\"katex--inline\">2^k</span> divides <span class=\"katex--inline\">59!</span></p>&#10;", "hints_md": "The title of this problem is a little bit of a clue ", "hints_html": "<p>The title of this problem is a little bit of a clue</p>&#10;", "editorial_md": "The problem requires us to find the largest power of $2$ that divides $59!$. This is a classic application of **Legendre's formula**, which is used to determine the highest power of a prime $p$ dividing $n!$. The formula is:\n\n$k = \\displaystyle\\sum_{i=1}^{\\infty}\n\\left\\lfloor \\frac{n}{p^i} \\right\\rfloor$ \n\nWhere:\n-   $n=59$ in our case,\n-   $p = 2$, since we are interested in powers of $2$,\n-   $\\left\\lfloor x \\right\\rfloor$ denotes the floor function, which rounds down to the nearest integer.\n\nWe will calculate $k$ by summing the number of multiples of $2$, $4$, $8$, and so on, up to the largest power of $2$ that is less than or equal to $59$:\n\n$k=\\left\\lfloor  \\frac{59}{2^1}\\right\\rfloor +\\left\\lfloor  \\frac{59}{2^2} \\right\\rfloor+\\left\\lfloor  \\frac{59}{2^3} \\right\\rfloor+\\left\\lfloor  \\frac{59}{2^4} \\right\\rfloor+\\left\\lfloor  \\frac{59}{2^5} \\right\\rfloor$ \n\nSince $2^6 > 59$, all subsequent terms will be zero, solving further, we get:\n\n$k=\\left\\lfloor  29.5\\right\\rfloor +\\left\\lfloor  14.75\\right\\rfloor+\\left\\lfloor  7.375 \\right\\rfloor+\\left\\lfloor  3.8675 \\right\\rfloor+\\left\\lfloor  1.84375 \\right\\rfloor$ \n\n$k = 29 + 14 + 7 + 3 +1 + 0 = 54$\n\nThus our answer is $54$.\n\n- botman\n", "editorial_html": "<p>The problem requires us to find the largest power of <span class=\"katex--inline\">2</span> that divides <span class=\"katex--inline\">59!</span>. This is a classic application of <strong>Legendre&#8217;s formula</strong>, which is used to determine the highest power of a prime <span class=\"katex--inline\">p</span> dividing <span class=\"katex--inline\">n!</span>. The formula is:</p>&#10;<p><span class=\"katex--inline\">k = \\displaystyle\\sum_{i=1}^{\\infty}&#10;\\left\\lfloor \\frac{n}{p^i} \\right\\rfloor</span></p>&#10;<p>Where:</p>&#10;<ul>&#10;<li><span class=\"katex--inline\">n=59</span> in our case,</li>&#10;<li><span class=\"katex--inline\">p = 2</span>, since we are interested in powers of <span class=\"katex--inline\">2</span>,</li>&#10;<li><span class=\"katex--inline\">\\left\\lfloor x \\right\\rfloor</span> denotes the floor function, which rounds down to the nearest integer.</li>&#10;</ul>&#10;<p>We will calculate <span class=\"katex--inline\">k</span> by summing the number of multiples of <span class=\"katex--inline\">2</span>, <span class=\"katex--inline\">4</span>, <span class=\"katex--inline\">8</span>, and so on, up to the largest power of <span class=\"katex--inline\">2</span> that is less than or equal to <span class=\"katex--inline\">59</span>:</p>&#10;<p><span class=\"katex--inline\">k=\\left\\lfloor  \\frac{59}{2^1}\\right\\rfloor +\\left\\lfloor  \\frac{59}{2^2} \\right\\rfloor+\\left\\lfloor  \\frac{59}{2^3} \\right\\rfloor+\\left\\lfloor  \\frac{59}{2^4} \\right\\rfloor+\\left\\lfloor  \\frac{59}{2^5} \\right\\rfloor</span></p>&#10;<p>Since <span class=\"katex--inline\">2^6 &gt; 59</span>, all subsequent terms will be zero, solving further, we get:</p>&#10;<p><span class=\"katex--inline\">k=\\left\\lfloor  29.5\\right\\rfloor +\\left\\lfloor  14.75\\right\\rfloor+\\left\\lfloor  7.375 \\right\\rfloor+\\left\\lfloor  3.8675 \\right\\rfloor+\\left\\lfloor  1.84375 \\right\\rfloor</span></p>&#10;<p><span class=\"katex--inline\">k = 29 + 14 + 7 + 3 +1 + 0 = 54</span></p>&#10;<p>Thus our answer is <span class=\"katex--inline\">54</span>.</p>&#10;<ul>&#10;<li>botman</li>&#10;</ul>&#10;", "flag_hint": "", "point_value": 2, "problem_name": "A Myth Could Also be Called a ____?", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}