{"id":186,"date":"2010-11-22T19:24:13","date_gmt":"2010-11-22T23:24:13","guid":{"rendered":"http:\/\/bitc.bme.emory.edu\/~lzhou\/blogs\/?p=186"},"modified":"2010-11-22T19:25:16","modified_gmt":"2010-11-22T23:25:16","slug":"recursive-prime-pk1mnpk311-base-1295557","status":"publish","type":"post","link":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/?p=186","title":{"rendered":"Recursive prime p(k+1)=m*((n*p(k))^3+1)+1 base 12^9*5^5^5+7"},"content":{"rendered":"<p>Define p(0)=12^9*5^5^5+7;<br \/>\np(1)[m=466;n=78]=466*((78*(12^9*5^3125+7))^3+1)+1;<br \/>\np(2)[m=6470;n=884]=6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1;<br \/>\np(3)[m=278822;n=33410]=278822*((33410*(6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1))^3+1)+1;<br \/>\np(4)[m=145950;n=46953]=145950*((46953*( 278822*((33410*(6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1))^3+1)+1))^3+1)+1;<\/p>\n<p>p(4) has database ID 96540 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=96540\">HERE<\/a>.<\/p>\n<p>The kernel 12^9*5^5^5+1 is proven by Primo.  The certificate is in the first reply of this post.<\/p>\n<p>The recursive primes are proven using OpenPFGW, by the command<br \/>\npfgw -t (or tp) -h&#8221;p(k)&#8221; p_h(k+1); pfgw -t (or tp) -h&#8221;p_h(k+1)&#8221; p(k+1)<br \/>\nThe number<br \/>\n  p_h(k+1)=(n*p(k)-1)*(n*p(k))+1=(n*p(k))^2-n*p(k)+1<br \/>\n  p(k+1)=m*((n*p(k))^3+1)+1=m*(n*p(k)+1)((n*p(k))^2-n*p(k)+1)+1=m*(n*p(k)+1)*p_h(k+1)+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&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;p_00&#8243; ph_01<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;ph_01&#8243; p_01<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;p_01&#8243; ph_02<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;ph_02&#8243; p_02<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;p_02&#8243; ph_03<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;ph_03&#8243; p_03<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;p_03&#8243; ph_04<br \/>\n.\/pfgw -l&#8221;pmtup_5.4.2.cert&#8221; -t -h&#8221;ph_04&#8243; p_04<\/p>\n<p>The certificate will be posted when done.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Define p(0)=12^9*5^5^5+7; p(1)[m=466;n=78]=466*((78*(12^9*5^3125+7))^3+1)+1; p(2)[m=6470;n=884]=6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1; p(3)[m=278822;n=33410]=278822*((33410*(6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1))^3+1)+1; p(4)[m=145950;n=46953]=145950*((46953*( 278822*((33410*(6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1))^3+1)+1))^3+1)+1; p(4) has database ID 96540 in The List of Largest Known Primes Home Page. The direct link is HERE. The kernel 12^9*5^5^5+1 is proven by Primo. The certificate is in the first reply of this post. The recursive primes are proven using OpenPFGW, by the command pfgw -t [&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-186","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\/186","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=186"}],"version-history":[{"count":0,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=\/wp\/v2\/posts\/186\/revisions"}],"wp:attachment":[{"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=186"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=186"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/csic.som.emory.edu\/~lzhou\/blogs\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=186"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}