{"id":644,"date":"2009-08-09T18:33:59","date_gmt":"2009-08-09T22:33:59","guid":{"rendered":"http:\/\/michaelnielsen.org\/blog\/?p=644"},"modified":"2009-08-09T18:33:59","modified_gmt":"2009-08-09T22:33:59","slug":"polymath4","status":"publish","type":"post","link":"https:\/\/michaelnielsen.org\/blog\/polymath4\/","title":{"rendered":"Polymath4"},"content":{"rendered":"<p>The Polymath4 Project is now underway, with the first formal post <a href=\"http:\/\/polymathprojects.org\/2009\/08\/09\/research-thread-ii-deterministic-way-to-find-primes\/\">here<\/a>.  <\/p>\n<p>The basic problem is very simple and appealing: it&#8217;s to find a deterministic algorithm which will quickly generate a prime of at least some given length, ideally in time polynomial in that length.   There are fast algorithms which will generate such a prime with high probability &#8211; cryptography algorithms like <a href=\"http:\/\/en.wikipedia.org\/wiki\/RSA\">RSA<\/a> wouldn&#8217;t work if that weren&#8217;t true.  But there&#8217;s no known deterministic algorithm.<\/p>\n<p>I&#8217;m going to miss the first week of the project &#8211; I&#8217;ll be <a href=\"https:\/\/wiki.har2009.org\/page\/Main_Page\">camping in a field in the Netherlands, surrounded by 1000+ hackers<\/a>.  But I&#8217;m looking forward to catching up when I come back.<\/p>\n<p>On a related note, John Baez <a href=\"http:\/\/golem.ph.utexas.edu\/category\/2009\/08\/what_do_mathematicians_need_to.html\">asks<\/a> what mathematicians need to know about blogs.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The Polymath4 Project is now underway, with the first formal post here. The basic problem is very simple and appealing: it&#8217;s to find a deterministic algorithm which will quickly generate a prime of at least some given length, ideally in time polynomial in that length. There are fast algorithms which will generate such a prime&hellip; <a class=\"more-link\" href=\"https:\/\/michaelnielsen.org\/blog\/polymath4\/\">Continue reading <span class=\"screen-reader-text\">Polymath4<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[71],"class_list":["post-644","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-polymath","entry"],"_links":{"self":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/644","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/comments?post=644"}],"version-history":[{"count":1,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/644\/revisions"}],"predecessor-version":[{"id":645,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/644\/revisions\/645"}],"wp:attachment":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/media?parent=644"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/categories?post=644"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/tags?post=644"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}