Y\u00fczy\u0131llar \u00f6nce, kafay\u0131 asal say\u0131lara takm\u0131\u015f Trakyal\u0131 bir erkek matematik\u00e7i, a\u015f\u0131k oldu\u011fu kad\u0131na \u015fu s\u00f6z\u00fc vermi\u015f: \u201cSeni o kadar \u00e7ok seviyorum ki, d\u00fcnyan\u0131n en b\u00fcy\u00fck asal say\u0131s\u0131n\u0131 bulup sana arma\u011fan edece\u011fim.\u201d Kad\u0131n da bo\u015f de\u011fil, d\u00f6nemin tan\u0131nm\u0131\u015f bir filozofu, desteksiz at\u0131\u015flara karn\u0131 tok. \u201cAtma bre sevgili\u201d demi\u015f, \u201cSonsuzlu\u011fun sonu mu olur? S\u00f6z\u00fcn\u00fc yerine getirmen i\u00e7in asal say\u0131lar\u0131 veren genel bir form\u00fcl bulman gerek. Ben nereden bilece\u011fim o say\u0131n\u0131n en b\u00fcy\u00fck asal say\u0131 oldu\u011funu?\u201d. Bu diyalog g\u00fcn\u00fcm\u00fcze ula\u015fm\u0131\u015f ama, ili\u015fkilerinin sonu ne olmu\u015f bilinmiyor. Tek bilinen b\u00f6yle bir form\u00fcl\u00fcn h\u00e2l\u00e2 bulunamad\u0131\u011f\u0131.<\/p>\n
Zaman zaman en b\u00fcy\u00fck asal say\u0131 rekorlar\u0131na rastlad\u0131\u011f\u0131mda akl\u0131ma hep bu \u00f6yk\u00fc gelir. Zavall\u0131 a\u015f\u0131k matematik\u00e7iler diye d\u00fc\u015f\u00fcn\u00fcr\u00fcm. Yine \u00f6yle oldu. Ge\u00e7enlerde ABD-Seattle\u2019da ya\u015fayan Josh Findley adl\u0131 bir gen\u00e7 matematik\u00e7inin en b\u00fcy\u00fck asal say\u0131 rekorunu k\u0131rd\u0131\u011f\u0131n\u0131 \u00f6\u011frendim. Findley, kendi diz\u00fcst\u00fc bilgisayar\u0131 ile 41 nolu Mersenne asal\u0131n\u0131 bulmu\u015f. Mersenne asallar\u0131, 2P<\/sup>-1 (p de bir asal say\u0131) form\u00fcl\u00fcn\u00fcn sonucunu veren say\u0131lar\u0131n asal olanlar\u0131. Yeni rekor: 224,036,583<\/sup> \u2013 1. Tam 7,235,733 rakamdan olu\u015fan bir asal say\u0131.<\/p>\n Josh\u2019un sevgilisi pek sevinmi\u015ftir, ama ne yaz\u0131k ki \u00e7ok uzun s\u00fcrmez, \u00e7\u00fcnk\u00fc her an yeni bir rekor gelebilir. Ben de bir zamanlar (on y\u0131llar \u00f6nce, gen\u00e7ken) bu konuya takm\u0131\u015f, sevgilime a\u015fk\u0131m\u0131 ispatlaman\u0131n s\u00fcrekli bir yolunu nas\u0131l bulurum diye kafa patlatm\u0131\u015ft\u0131m. \u015e\u00f6yle bir y\u00f6ntem d\u00fc\u015f\u00fcnm\u00fc\u015ft\u00fcm: Genel bir asal say\u0131 form\u00fcl\u00fc yerine, daha m\u00fctevaz\u0131 bir bulu\u015f yapay\u0131m. Herhangi bir asal say\u0131dan hemen sonra gelen asal say\u0131y\u0131 belirlemenin y\u00f6ntemini bulay\u0131m. B\u00f6ylece Josh\u2019un biri benimkinden daha b\u00fcy\u00fck bir asal say\u0131 buldu\u011funda, hemen ondan sonra gelen asal say\u0131y\u0131 belirlerim, sevgilimi de kapt\u0131rmam\u0131\u015f olurum. Gen\u00e7lik i\u015fte… \u015eimdi bak\u0131yorum da, b\u00f6yle bir y\u00f6ntem geli\u015ftirmenin genel bir asal say\u0131 form\u00fcl\u00fc bulmaktan ne fark\u0131 var ki?<\/p>\n Josh\u2019a mutluluklar diliyorum. \u015eu g\u00fcnlerin tad\u0131n\u0131 \u00e7\u0131kars\u0131n.<\/p>\n","protected":false},"excerpt":{"rendered":" Y\u00fczy\u0131llar \u00f6nce, kafay\u0131 asal say\u0131lara takm\u0131\u015f Trakyal\u0131 bir erkek matematik\u00e7i, a\u015f\u0131k oldu\u011fu kad\u0131na \u015fu s\u00f6z\u00fc vermi\u015f: \u201cSeni o kadar \u00e7ok seviyorum ki, d\u00fcnyan\u0131n en b\u00fcy\u00fck asal say\u0131s\u0131n\u0131 bulup sana arma\u011fan edece\u011fim.\u201d Kad\u0131n da bo\u015f de\u011fil, d\u00f6nemin tan\u0131nm\u0131\u015f bir filozofu, desteksiz at\u0131\u015flara karn\u0131 tok. \u201cAtma bre sevgili\u201d demi\u015f, \u201cSonsuzlu\u011fun sonu mu olur? S\u00f6z\u00fcn\u00fc yerine getirmen i\u00e7in […]<\/p>\n","protected":false},"author":484,"featured_media":9013,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[43,565,25],"tags":[566,208],"class_list":["post-9012","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-5-sayi","category-bunlari-biliyor-muydunuz","category-matematik","tag-asal-sayi","tag-matematik"],"acf":[],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t