{"id":10,"date":"2004-02-21T23:06:00","date_gmt":"2004-02-21T23:06:00","guid":{"rendered":"http:\/\/www.sixthform.info\/maths\/?p=10"},"modified":"2009-11-17T23:44:57","modified_gmt":"2009-11-17T23:44:57","slug":"factorials","status":"publish","type":"post","link":"https:\/\/www.sixthform.info\/maths\/?p=10","title":{"rendered":"Factorials"},"content":{"rendered":"<p><font size=1><i>Inspired by a test posting on <a href=\"http:\/\/www.sosmath.com\/CBB\/viewtopic.php?t=5385\">S.O.S. Mathematics CyberBoard<\/a> <\/i><\/font><\/p>\n<p>Factorials are fascinating. They are obtained by multiplying the numbers 1, 2, 3, 4, 5 &#8230; together and are written using the ! sign. Thus<\/p>\n<p><img src='\/maths\/latexrender\/pictures\/f99bc5b3f9e5c67b4902440132dfc032.gif' title='\\begin{array}{llllr}&#10;1! &amp;=&amp;1&amp;=&amp;1 \\\\&#10;2!&amp;=&amp;1\\times2&amp;=&amp;2 \\\\&#10;3!&amp;=&amp;1\\times2\\times3&amp;=&amp;6 \\\\&#10;4!&amp;=&amp;1\\times2\\times3\\times4&amp;=&amp;24 \\\\&#10;5!&amp;=&amp;1\\times2\\times3\\times4\\times5&amp;=&amp;120 \\\\&#10;&amp;&amp;\\cdots \\\\&#10;10!&amp;=&amp;1\\times2\\times3\\times\\ldots\\times10&amp;=&amp;3628800 \\\\&#10;&amp;&amp;\\cdots&#10;\\end{array}' alt='\\begin{array}{llllr}&#10;1! &amp;=&amp;1&amp;=&amp;1 \\\\&#10;2!&amp;=&amp;1\\times2&amp;=&amp;2 \\\\&#10;3!&amp;=&amp;1\\times2\\times3&amp;=&amp;6 \\\\&#10;4!&amp;=&amp;1\\times2\\times3\\times4&amp;=&amp;24 \\\\&#10;5!&amp;=&amp;1\\times2\\times3\\times4\\times5&amp;=&amp;120 \\\\&#10;&amp;&amp;\\cdots \\\\&#10;10!&amp;=&amp;1\\times2\\times3\\times\\ldots\\times10&amp;=&amp;3628800 \\\\&#10;&amp;&amp;\\cdots&#10;\\end{array}' align=absmiddle><\/p>\n<p>Factorials get large very quickly so 25! = 15 511 210 043 330 985 984 000 000 and as it gets larger there are more and more zeros.<\/p>\n<p><b>Question:<\/b> How can you find the number of zeros in 102! without calculating it?<br \/>\n<b>Answer:<\/b> All you do is count the number of times powers of 5 divide into 102 and add them up. So<br \/>\n<img src='\/maths\/latexrender\/pictures\/b61a0095aea881a63fd6098c0c4efb0a.gif' title='\\begin{array}{llrl}&#10;102\\div5&amp;=&amp;20&amp; \\textrm{plus a remainder} \\\\&#10;102\\div5^2&amp;=&amp;4&amp; \\textrm{plus a remainder} \\\\&#10;102\\div5^3&amp;=&amp;0&amp; \\textrm{plus a remainder - get 0 so no higher powers needed}&#10;\\end{array}' alt='\\begin{array}{llrl}&#10;102\\div5&amp;=&amp;20&amp; \\textrm{plus a remainder} \\\\&#10;102\\div5^2&amp;=&amp;4&amp; \\textrm{plus a remainder} \\\\&#10;102\\div5^3&amp;=&amp;0&amp; \\textrm{plus a remainder - get 0 so no higher powers needed}&#10;\\end{array}' align=absmiddle><\/p>\n<p>\nThrow away the remainders and we get that there are <img src='\/maths\/latexrender\/pictures\/185cce80fe016d0600e6b101cd4d82c5.gif' title='20+4=24' alt='20+4=24' align=absmiddle> zeros in 102!<br \/>\nNow find how many zeros there are in 2004!<\/p>\n<p>Can you show why this method works? Can you generalise it? Have a go, then look for answers on the internet.<\/p>\n<p>Mathematicians will recognise this as a special case of<br \/>\n<img src='\/maths\/latexrender\/pictures\/a8aa8feb71aa03733c985da6c650a100.gif' title='\\par\\boxed{\\begin{displaymath}&#10;\\textit{The highest power of a prime p dividing n! is }&#10;\\sum_{k=1}^\\infty \\left[\\frac{n}{p^k}\\right]&#10;\\hspace{0.5em}&#10;\\end{displaymath}}' alt='\\par\\boxed{\\begin{displaymath}&#10;\\textit{The highest power of a prime p dividing n! is }&#10;\\sum_{k=1}^\\infty \\left[\\frac{n}{p^k}\\right]&#10;\\hspace{0.5em}&#10;\\end{displaymath}}' align=absmiddle><br \/>\nwhich is not difficult to prove by induction.<\/p>\n<p>More on factorials at <a href=\"http:\/\/mathworld.wolfram.com\/Factorial.html\">mathworld<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Inspired by a test posting on S.O.S. Mathematics CyberBoard Factorials are fascinating. They are obtained by multiplying the numbers 1, 2, 3, 4, 5 &#8230; together and are written using the ! sign. Thus Factorials get large very quickly so 25! = 15 511 210 043 330 985 984 000 000 and as it gets [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-10","post","type-post","status-publish","format-standard","hentry","category-articles"],"_links":{"self":[{"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=\/wp\/v2\/posts\/10","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=10"}],"version-history":[{"count":3,"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=\/wp\/v2\/posts\/10\/revisions"}],"predecessor-version":[{"id":178,"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=\/wp\/v2\/posts\/10\/revisions\/178"}],"wp:attachment":[{"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=10"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=10"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.sixthform.info\/maths\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}