mersenneforum.org Brent tables reservations
 Register FAQ Search Today's Posts Mark Forums Read

 2012-03-20, 17:50 #1 chris2be8     Sep 2009 2×3×5×79 Posts Brent tables reservations This thread is to co-ordinate work on the Brent tables (a^b+1 and a^b-1 with 13<=a<=99 and product <10^255). See http://maths.anu.edu.au/~brent/factors.html for the list (but check http://www.factordb.com/ for updates not on his site). I'm working on: 15^196+1 54^133+1 82^103-1 85^103+1 Chris K
 2012-03-20, 20:43 #2 wblipp     "William" May 2003 New Haven 22×593 Posts This overlaps oddperfect.org's interest in p^q-1 with p an odd prime, q a prime (also, rarely but occasionally, q composite). Here are the overlaps currently in our system 43^137-1 ready for GNFS - see composites page 43^151-1 queued for SNFS factoring by RSALS 73^127-1 ready for SNFS by RSALS, not yet queued 79^113-1 ready for SNFS by RSALS, not yet queued 83^121-1 ECM pretesting in process 89^121-1 ECM pretesting in process
 2012-03-22, 02:52 #3 jcrombie     "Jonathan" Jul 2010 In a tangled web... 5·43 Posts Chris, William, I'm currently taking about a one month break from the Brent composites (going to be out of the country). Will make my reservations when I get back.
 2012-03-22, 18:12 #4 chris2be8     Sep 2009 2×3×5×79 Posts Reserving: 66^130+1 44^122+1 53^116+1 Chris K PS. 82^103-1 is done, factors in factordb.
 2012-03-29, 18:42 #5 chris2be8     Sep 2009 2×3×5×79 Posts I've finished: 15^196+1 66^130+1 85^103+1 and nearly finished 44^122+1 so it's time to reserve some more. Reserving: 89^103+1 70^109-1 72^121-1 Chris K
 2012-04-03, 16:50 #6 chris2be8     Sep 2009 1001010000102 Posts Time to reserve a few more: 35^131+1 79^125+1 88^119-1 90^103-1 I'm going to avoid numbers jcrombie will get to fairly soon (50-69^n). Chris K
 2012-04-12, 16:53 #7 chris2be8     Sep 2009 2·3·5·79 Posts I've done most of the last lot so I'll reserve: 14^203-1 90^119-1 91^103-1 91^103+1 Chris K
 2012-04-20, 01:46 #8 jcrombie     "Jonathan" Jul 2010 In a tangled web... 5·43 Posts Reserving: 48^127+1
 2012-04-20, 16:34 #9 chris2be8     Sep 2009 2×3×5×79 Posts It's time to reserve some more: 23^175-1 44^145+1 It's taking 2-3 days per number now so 2 should be enough for a few days. Chris
 2012-04-26, 08:57 #10 chris2be8     Sep 2009 1001010000102 Posts I've finished 23^175-1 and started on 44^145+1 so it's time to reserve some more: 72^109+1 75^121-1 75^121+1 Chris
 2012-04-27, 23:51 #11 FactorEyes     Oct 2006 vomit_frame_pointer 5508 Posts My 2 cents I have polynomials for these numbers: 44^151+1 79^133-1 23^187+1 58^140+1 31^166+1 72^136+1 82^127+1 Since I see no reservations for these puppies, I'll reserve them. The polynomials were computed by jrk nearly a year ago, then placed in oak casks in an abandoned salt mine deep beneath the Nevada desert, where they were attended by a team of highly-athletic yet caring virgin high jumpers between the ages of 16 and 19.4997. I am glad to see interest on these numbers. I know little about the ECM work done on them, other than that some has been done. I think factors of less than 10^50 are unlikely to remain, but I did find a p48 last year, and I doubt that the composites have been ECM'ed much above some small multiple of t50. However: If you have any information as to the ECM status, please share it here. The remaining composites are getting large enough that collaboration becomes a somewhat-rewarding possibility. I have between 16 and 24 core-17 940 threads to spare, depending on Real Life and my air-conditioning. Last fiddled with by FactorEyes on 2012-04-28 at 00:28

 Similar Threads Thread Thread Starter Forum Replies Last Post Zeta-Flux Factoring 74 2010-04-07 22:03 S485122 Math 1 2009-08-23 15:21 FactorEyes Factoring 23 2008-02-22 00:36 bsquared Factoring 9 2007-05-18 19:24 jhillenb Factoring 4 2005-01-11 23:50

All times are UTC. The time now is 20:22.

Thu Aug 18 20:22:58 UTC 2022 up 17:51, 1 user, load averages: 1.26, 1.39, 1.46

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.

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