mersenneforum.org Octoproth Discussion
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2006-01-12, 03:12 #1 Kosmaj     Nov 2003 2·1,811 Posts Reserving 337 <= n <= 350.
 2006-01-13, 10:53 #2 Kosmaj     Nov 2003 70468 Posts Stopping and releasing n=337, checked to 200T.
 2006-02-01, 05:38 #3 Kosmaj     Nov 2003 2·1,811 Posts Found the new largest OctoProth 1377602248158885 346 with 120 digits in k*2^n+/-1 members and 105 digits in 2^n+/-k ones. Releasing 339-347, all checked to 1.5E15 (1500T). Will work a little bit more on 348-350.
 2006-02-02, 00:21 #4 robert44444uk     Jun 2003 Suva, Fiji 37678 Posts Brill Well done Kosmaj, a notable scalp. just one thing, the difference between 2^k+n and 2^+k-n is probably worth noting. Regards Robert Smith
 2006-02-02, 03:46 #5 Kosmaj     Nov 2003 2×1,811 Posts Robert, thanks! I was about to release them at 1300T but I thought I better go to the next "nice" number (1500T). As for the difference between 2^n+k and 2^n-k it sure is 2k (a 16 digit number) but in comparison to numbers themselves it can /almost/ be ignored since the first 88 digits are the same and only the 17 least-significant digits are different. BTW, since you have moderator rights and Greenbank /kind of/ disappeared, can you edit the first post and enter the latest results. Thanks!
 2006-02-02, 14:23 #6 robert44444uk     Jun 2003 Suva, Fiji 111111101112 Posts Moderator Kosmaj, I am only an honorary moderator I think, I have no idea on how to massage the threads. Maybe we should just await Greenbank's return and hope his absence is no more than a vacation. Either that or we will need new moderators Regards Robert Smith
 2006-02-02, 15:41 #7 Kosmaj     Nov 2003 70468 Posts Well, celebrities too sometimes have to go under the hood and fix things It's easy, just scroll to the post you want to change. Under the post you will see the "Edit" button. [Mortals cannot see it! ] Just click on it and the post will appear in an edit-mode window. After applying the changes just click on "Save" and Voila!, it's done!
 2006-02-04, 11:50 #8 robert44444uk     Jun 2003 Suva, Fiji 2,039 Posts All entered to here Lads I have updated everything to here Regards Robert Smith
 2006-02-13, 04:23 #9 Kosmaj     Nov 2003 2·1,811 Posts Robert Congrats on new records! If we use the criterion suggested by Jens Andersen to compare them, then the k=164... one is slightly larger, 2^n+/-k members have 113 digits, k*2^n+/-1 twins have 128 and k*2^(n+1)+/-1 ones have 129 digits.
 2006-02-13, 05:35 #10 Jens K Andersen     Feb 2006 Denmark 2×5×23 Posts Hi. I recently joined the Mersenne forum. My record page http://hjem.get2net.dk/jka/math/simultprime.htm would compare the 4th of 8 primes. This is 2^(n+1)+k for an octoproth, so the larger k wins. It's a rule for my site (made with other forms in mind) and was not meant as a suggestion for you. By the way, I have increased the record for 12 simultaneous primes from 44 to 58 digits. This makes a dodecaproth record much harder.
 2006-03-05, 15:36 #11 jasong     "Jason Goatcher" Mar 2005 350710 Posts Is this the right place to place reservations for the octoproth search? I'm sitting on my results until someone confirms I'm not doing old work or invading someone else's territory.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post jasong Octoproth Search 9 2007-12-27 02:44 Greenbank Octoproth Search 2 2007-12-26 09:58 roger Octoproth Search 2 2007-11-17 12:57 em99010pepe Octoproth Search 15 2006-11-25 22:10 Greenbank Octoproth Search 11 2006-01-19 11:42

All times are UTC. The time now is 06:23.

Wed Jul 6 06:23:44 UTC 2022 up 83 days, 4:25, 0 users, load averages: 1.25, 1.22, 1.21

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔