<\/p>\n
11, 101, 1001, . . .<\/p>\n
<\/p>\n
Are there infinitely many primes? Infinitely many composite numbers?<\/p>\n
Answer.<\/b>\u00a0High school student Andrew Sullivan was the first to submit that whenever n is odd, 10n<\/sup>\u00a0+ 1 is divisible by 11. Indeed, modulo 11, 10n<\/sup>\u00a0+ 1 = (-1)n<\/sup>\u00a0+ 1 = 0 if n is odd. So there are infinitely many composite numbers.<\/p>\n It seems to be an open question whether there are infinitely many primes, but Luke Gustafson argues against it. The same argument as above shows that whenever n has an odd factor (as 56 = 8 x 7 has the odd factor 7), then 10n<\/sup>\u00a0+ 1 can be factored. For example, modulo 108<\/sup>\u00a0+ 1, 1056<\/sup>\u00a0+ 1 = (-1)7<\/sup>\u00a0+ 1 = 0. Therefore for 10n<\/sup>\u00a0+ 1 to be prime, n must be a power of 2: 10n<\/sup>\u00a0+ 1 =\u00a0 Gustafson continues: “On the other hand,\u00a0 Also open is the similar question of whether there are infinitely many “Fermat” primes\u00a0 Spain.<\/b>\u00a0I am currently touring Spain, giving a short course on geometric measure theory and popular talks in Spanish on “The Geometry of Soap Bubbles 2000,” including news on our recent proof of the Double Bubble Conjecture (see Math Chat of\u00a0March 18<\/a>). The leading newspaper,\u00a0El Pais,<\/i>\u00a0wrote (as best as I can translate it): “I want to know, for example, how much Morgan’s visit is costing us. . . Unless this gentleman can explain to me how the soap bubbles of 2000 are markedly different from those of 1999, I do not understand why an academic institution would spend money for something like this.” Fortunately there were some good responses. I have tried to explain that geometry provides one way to understand the world and the universe, and that the way to understand the complicated geometry of the universe is to start with the simpler geometry of soap bubbles.<\/p>\n In general, mathematics is flourishing, thanks in part to the efforts of the Spanish Mathematical Society under President Antonio Naveira (Valencia) and Secretary Salvador Segura Gomis (Alicante and Murcia). Gomis contributes the following new challenge:<\/p>\n New Challenge.<\/b>\u00a0What is the shortest line segment fencing off prescribed area 0\u00a0The next Math Chat will appear on the fourth instead of the third Thursday of June.<\/a><\/p>\n <\/p>\n Send answers, comments, and new questions by email to\u00a0<\/a>Frank.Morgan@williams.edu,<\/a>\u00a0to be eligible for\u00a0Flatland\u00a0<\/i>and other book awards. Winning answers will appear in the next Math Chat. Math Chat appears on the first and third Thursdays of each month. Prof. Morgan’s homepage is at\u00a0www.williams.edu\/Mathematics\/fmorgan.<\/a><\/p>\n THE MATH CHAT BOOK,<\/a>\u00a0including a $1000 Math Chat Book\u00a0QUEST,\u00a0<\/a>questions and answers, and a list of past challenge winners, is now available from the MAA (800-331-1622).<\/p>\n Copyright 2000, Frank Morgan.<\/p>\n","protected":false},"excerpt":{"rendered":" June 1, 2000 Old Challenge.\u00a0Consider the sequence of integers 10n\u00a0+ 1: 11, 101, 1001, . . . Are there infinitely many primes? Infinitely many composite numbers? Answer.\u00a0High school student Andrew Sullivan was the first to submit that whenever n is odd, 10n\u00a0+ 1 is divisible by 11. Indeed, modulo 11, 10n\u00a0+ 1 […]<\/p>\n","protected":false},"author":2965,"featured_media":0,"parent":3459,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"footnotes":""},"class_list":["post-3684","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3684","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/users\/2965"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/comments?post=3684"}],"version-history":[{"count":3,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3684\/revisions"}],"predecessor-version":[{"id":3774,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3684\/revisions\/3774"}],"up":[{"embeddable":true,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3459"}],"wp:attachment":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/media?parent=3684"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}![](\"https:\/\/maa.org\/sites\/default\/files\/images\/features\/mathchat\/prime1.gif\")
.<\/p>\n\u00a0does not factor algebraically, so it is quite possible that there are infinitely many primes of this form. As one would expect, mathematicians have spent a good deal of time investigating this form. The only known prime values for the expression are\u00a0![](\"https:\/\/maa.org\/sites\/default\/files\/images\/features\/mathchat\/prime2.gif\")
\u00a0= 101<\/sup>\u00a0+ 1 = 11 and\u00a0![](\"https:\/\/maa.org\/sites\/default\/files\/images\/features\/mathchat\/prime3.gif\")
\u00a0= 102<\/sup>\u00a0+ 1 = 101, and there are no more prime values up to and including\u00a0![](\"https:\/\/maa.org\/sites\/default\/files\/images\/features\/mathchat\/prime4.gif\")
. It isn’t very likely that there are infinitely many primes; after all,\u00a0\u00a0doubles in digits with each increase in k, thereby halving the chance of primality (by the Prime Number Theorem).”<\/p>\n![](\"https:\/\/maa.org\/sites\/default\/files\/images\/features\/mathchat\/prime5.gif\")
, related to whether a regular N-gon can be constructed with ruler and compass.<\/p>\n
\n