{"id":23706,"date":"2013-08-08T09:25:18","date_gmt":"2013-08-08T13:25:18","guid":{"rendered":"http:\/\/blogs.ams.org\/mathgradblog\/?p=23706"},"modified":"2014-06-26T16:25:54","modified_gmt":"2014-06-26T21:25:54","slug":"problem-brocard","status":"publish","type":"post","link":"https:\/\/blogs.ams.org\/mathgradblog\/2013\/08\/08\/problem-brocard\/","title":{"rendered":"The Problem Of Brocard"},"content":{"rendered":"<p><div id=\"attachment_23772\" style=\"width: 193px\" class=\"wp-caption alignleft\"><a href=\"http:\/\/blogs.ams.org\/mathgradblog\/files\/2013\/08\/250px-Brocardpage-e1375914700709.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-23772\" class=\"size-medium wp-image-23772 \" src=\"http:\/\/blogs.ams.org\/mathgradblog\/files\/2013\/08\/250px-Brocardpage-e1375914700709-183x300.png\" alt=\"The first page of Brocard's  original 1897 Paper.  Photo Credit [ Wikimedia Commons]\" width=\"183\" height=\"300\" srcset=\"https:\/\/blogs.ams.org\/mathgradblog\/files\/2013\/08\/250px-Brocardpage-e1375914700709-183x300.png 183w, https:\/\/blogs.ams.org\/mathgradblog\/files\/2013\/08\/250px-Brocardpage-e1375914700709.png 250w\" sizes=\"auto, (max-width: 183px) 100vw, 183px\" \/><\/a><p id=\"caption-attachment-23772\" class=\"wp-caption-text\">The first page of Brocard&#8217;s original 1897 Paper. Photo Credit [ Wikimedia Commons]<\/p><\/div>Down through the river of time, rapids of mathematical imagination have emerged curving the path of linear thought.\u00a0\u00a0 Often times, problems arising from these rocky waters branch off into smaller streams and drift indefinitely avoiding the trappings of resolution.\u00a0 One such problem was introduced by the French mathematician Henri Brocard in 1876 and later, in a separate paper, in 1885.\u00a0 Brocard inquired about a set of possible positive\u00a0integers <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> such that the equation <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%21+%2B+1+%3D+m%5E%7B2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n! + 1 = m^{2}\" class=\"latex\" \/> is satisfied.<\/p>\n<p><!--more--><\/p>\n<p>The <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%21&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n!\" class=\"latex\" \/> term in the equation is known as the factorial of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/>.\u00a0 Basically, for any positive integer <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/>, <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> factorial is defined as the multiplicative product of all of the integers from 1 to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/>.\u00a0 \u00a0For example, 4 factorial\u00a0is simply\u00a04\u00a0x 3\u00a0x 2\u00a0x 1 = 24.\u00a0 With this definition it is to see the obscurity surrounding the problem of finding a set of solutions that satisfy the equation. \u00a0The basic question still remains: For what positive integers <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> is the equation\u00a0\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%21+%2B+1+%3D+m%5E%7B2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n! + 1 = m^{2}\" class=\"latex\" \/> \u00a0satisfied for some positive integer <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=m&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"m\" class=\"latex\" \/>?<\/p>\n<p>There are only three known solutions.\u00a0 Ordered pairs (<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/>,<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=m&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"m\" class=\"latex\" \/>) that satisfy the equation are known as Brown Numbers.\u00a0 The only three known pairs of Brown Numbers are (4, 5), (5, 11), and (7, 71).\u00a0 More formally, Brocard\u2019s Problem asks the question: Does $n$ and $m$ exist such that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%21+%2B+1+%3D+m%5E%7B2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n! + 1 = m^{2}\" class=\"latex\" \/> other than for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> = 4, 5, and 7?\u00a0 In other words, Do more pairs of Brown Numbers exist other than (4,5), (5,11), and (7,71)?<\/p>\n<p>The prolific mathematician Paul Erd\u0151s conjectured that no other pairs of Brown Numbers exist.\u00a0 In 2000, mathematicians Bruce C. Berndt and William F. Galway published a paper, \u201cThe Brocard-Ramanujan diophantine equation <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%21+%2B+1+%3D+m%5E%7B2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n! + 1 = m^{2}\" class=\"latex\" \/>\u201d in <i>The Ramanujan Journal <\/i>\u00a0showing computational verification that no other solutions exist for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> up to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=10%5E%7B9%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"10^{9}\" class=\"latex\" \/>.\u00a0 Furthermore, it was proved by mathematicians A. Dabrowski (1996) and Florian Luca (2002), that the equation only has finitely many solutions assuming another major unsolved problem in Number Theory, the abc conjecture, is true.<\/p>\n<p>So, does there exist any more pairs of Brown Numbers?\u00a0 With the computational verification of Berndt and Galway one is tempted to say no.\u00a0 However, past mathematical inquiry has shown that computational verification does not always mean proof.\u00a0 \u00a0For some conjectures, counterexamples have been shown to creep up just beyond extensive computational rendering.\u00a0 In any case, Brocard\u2019s Problem is still gushing in the rapids of mathematical imagination.<\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" ><\/div>","protected":false},"excerpt":{"rendered":"<p>Down through the river of time, rapids of mathematical imagination have emerged curving the path of linear thought.\u00a0\u00a0 Often times, problems arising from these rocky waters branch off into smaller streams and drift indefinitely avoiding the trappings of resolution.\u00a0 One &hellip; <a href=\"https:\/\/blogs.ams.org\/mathgradblog\/2013\/08\/08\/problem-brocard\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" data-url=https:\/\/blogs.ams.org\/mathgradblog\/2013\/08\/08\/problem-brocard\/><\/div>\n","protected":false},"author":60,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[3,8,12,15,1],"tags":[],"class_list":["post-23706","post","type-post","status-publish","format-standard","hentry","category-ams","category-general","category-math","category-mathematics-in-society","category-uncategorized"],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p3gbww-6am","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/posts\/23706","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/users\/60"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/comments?post=23706"}],"version-history":[{"count":92,"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/posts\/23706\/revisions"}],"predecessor-version":[{"id":24940,"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/posts\/23706\/revisions\/24940"}],"wp:attachment":[{"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/media?parent=23706"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/categories?post=23706"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ams.org\/mathgradblog\/wp-json\/wp\/v2\/tags?post=23706"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}