{"id":154,"date":"2010-08-30T19:37:53","date_gmt":"2010-08-30T23:37:53","guid":{"rendered":"http:\/\/bitc.bme.emory.edu\/~lzhou\/blogs\/?p=154"},"modified":"2010-08-30T20:02:46","modified_gmt":"2010-08-31T00:02:46","slug":"recursive-prime-pk1mpk2-1-with-minimum-m","status":"publish","type":"post","link":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/?p=154","title":{"rendered":"Recursive prime p(k+1)=m*p(k)^2+\/-1 with minimum m"},"content":{"rendered":"<p>Define p(0)=1;<br \/>\np(1)=2*P(0)^2+1=3;<br \/>\np(2)=2*p(1)^2-1=17;<br \/>\np(3)=2*p(2)^2-1=577;<br \/>\np(4)=2*p(3)^2-1=665857;<br \/>\np(5)=20*p(4)^2-1;<br \/>\np(6)=2*p(5)^2-1;<br \/>\np(7)=28*p(6)^2+1;<br \/>\np(8)=182*p(7)^2-1;<br \/>\np(9)=272*p(8)^2-1;<br \/>\np(10)=540*p(9)^2+1;<br \/>\np(11)=162*p(10)^2+1;<br \/>\np(12)=1002*p(11)^2+1;<br \/>\np(13)=112*p(12)^2+1;<br \/>\np(14)=306*p(13)^2-1;<br \/>\np(15)=1752*p(14)^2+1;<br \/>\np(16)=20564*p(15)^2-1;<br \/>\np(17)=135236*p(16)^2-1;<br \/>\np(18)=547952*p(17)^2-1;<br \/>\np(19)=282904*p(18)^2+1;<\/p>\n<p>p(19)=282904*(547952*(135236*(20564*(1752*(306*(112*(1002*(162*(540*(272*(182*(28*(2*8867310888979^2-1)^2+1)^2-1)^2-1)^2+1)^2+1)^2+1)^2+1)^2-1)^2+1)^2-1)^2-1)^2-1)^2+1 has database ID 94235  in <a href=\"http:\/\/primes.utm.edu\/primes\/home.php\">The List of Largest Known Primes Home Page<\/a>.  The direct link is <a href=\"http:\/\/primes.utm.edu\/primes\/page.php?id=94235\">HERE<\/a>.<\/p>\n<p>These primes are recursively proven using OpenPFGW, by the command<br \/>\npfgw -t (or tp) -h&#8221;p(k)&#8221; p(k+1)<br \/>\nThe number<br \/>\n  p(k+1)=m*p(k)^2+\/-1<br \/>\nare reformatted by Mathematica to get the short expression.<\/p>\n<p>The final certification code is<br \/>\n#!\/bin\/sh<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t p_06<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -tp -h\u201dp_06\u2033 p_07<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -tp -h\u201dp_07\u2033 p_08<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -tp -h\u201dp_08\u2033 p_09<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -tp -h\u201dp_09\u2033 p_10<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_10\u2033 p_11<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_11\u2033 p_12<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_12\u2033 p_13<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_13\u2033 p_14<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_14\u2033 p_15<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_15\u2033 p_16<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_16\u2033 p_17<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -tp -h\u201dp_17\u2033 p_18<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -tp -h\u201dp_18\u2033 p_19<br \/>\n.\/pfgw -l\u201dpmrtrain.21.cert\u201d -t -h\u201dp_19\u2033 p_20<\/p>\n<p>The certificate will be posted when done.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Define p(0)=1; p(1)=2*P(0)^2+1=3; p(2)=2*p(1)^2-1=17; p(3)=2*p(2)^2-1=577; p(4)=2*p(3)^2-1=665857; p(5)=20*p(4)^2-1; p(6)=2*p(5)^2-1; p(7)=28*p(6)^2+1; p(8)=182*p(7)^2-1; p(9)=272*p(8)^2-1; p(10)=540*p(9)^2+1; p(11)=162*p(10)^2+1; p(12)=1002*p(11)^2+1; p(13)=112*p(12)^2+1; p(14)=306*p(13)^2-1; p(15)=1752*p(14)^2+1; p(16)=20564*p(15)^2-1; p(17)=135236*p(16)^2-1; p(18)=547952*p(17)^2-1; p(19)=282904*p(18)^2+1; p(19)=282904*(547952*(135236*(20564*(1752*(306*(112*(1002*(162*(540*(272*(182*(28*(2*8867310888979^2-1)^2+1)^2-1)^2-1)^2+1)^2+1)^2+1)^2+1)^2-1)^2+1)^2-1)^2-1)^2-1)^2+1 has database ID 94235 in The List of Largest Known Primes Home Page. The direct link is HERE. These primes are recursively proven using OpenPFGW, by the command pfgw -t (or tp) -h&#8221;p(k)&#8221; [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,6],"tags":[],"class_list":["post-154","post","type-post","status-publish","format-standard","hentry","category-to-entertain-myself","category-looking-for-a-megaprime","post-blog"],"_links":{"self":[{"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=\/wp\/v2\/posts\/154","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=154"}],"version-history":[{"count":0,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=\/wp\/v2\/posts\/154\/revisions"}],"wp:attachment":[{"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=154"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=154"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=154"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}