{"id":315,"date":"2019-06-26T23:33:45","date_gmt":"2019-06-26T23:33:45","guid":{"rendered":"http:\/\/funfacts.104.42.120.246.xip.io\/?page_id=315"},"modified":"2019-11-22T19:52:57","modified_gmt":"2019-11-22T19:52:57","slug":"gaps-in-primes","status":"publish","type":"page","link":"https:\/\/math.hmc.edu\/funfacts\/gaps-in-primes\/","title":{"rendered":"Gaps in Primes"},"content":{"rendered":"\n<p>We know there are\u00a0infinitely many primes, so are many interesting questions you can ask about the\u00a0distribution of primes, i.e., how they spread themselves out. Here is something to ponder: are there arbitrarily large &#8220;gaps&#8221; in the sequence of primes?<\/p>\n\n\n\n<p>At first this may seem like a tough question to tackle, since it is sometimes tedious to determine whether a number is prime. But it may help to look at the problem a different way: can I find long sequences of successive integers which are all composite?<\/p>\n\n\n\n<p>Yes, and now it is easy to see why. Suppose I want to find (N-1) consecutive integers that are composite. The number N! has, as factors, all numbers between 1 and N. Therefore:&nbsp;<br>N!+2 is composite, since it is divisible by 2.&nbsp;<br>N!+3 is composite, since it is divisible by 3.<\/p>\n\n\n\n<p>In fact, for similar reasons, N!+k is composite for all k between 2 and N. This is a string of (N-1) successive integers which are all composite.<\/p>\n\n\n\n<p><strong>Presentation&nbsp;Suggestions:<\/strong><br>It may be good to warm up by asking is what the largest prime gap less than 100.<\/p>\n\n\n\n<p><strong>The&nbsp;Math&nbsp;Behind&nbsp;the&nbsp;Fact:<\/strong><br>Sometimes simple deductions can lead to surprising results!<\/p>\n\n\n\n<p><strong>How to Cite this Page:<\/strong>&nbsp;<br>Su, Francis E., et al. &#8220;Gaps in Primes.&#8221;&nbsp;<em>Math Fun Facts<\/em>. &lt;http:\/\/www.math.hmc.edu\/funfacts&gt;.<\/p>\n\n\n\n<p><strong>Fun Fact suggested by:   <\/strong><br>Lesley Ward <\/p>\n","protected":false},"excerpt":{"rendered":"<p>We know there are\u00a0infinitely many primes, so are many interesting questions you can ask about the\u00a0distribution of primes, i.e., how&#46;&#46;&#46;<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"tags":[3,10,49],"class_list":["post-315","page","type-page","status-publish","hentry","tag-easy","tag-numtheory","tag-prime"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/315","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/comments?post=315"}],"version-history":[{"count":3,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/315\/revisions"}],"predecessor-version":[{"id":1460,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/315\/revisions\/1460"}],"wp:attachment":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/media?parent=315"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/tags?post=315"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}