mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Lone Mersenne Hunters

Reply
 
Thread Tools
Old 2003-10-29, 12:22   #1
HiddenWarrior
 
HiddenWarrior's Avatar
 
Jun 2003
Russia, Novosibirsk

2×107 Posts
Default 57 bits to 60 bits

I work out to factor all primes with factorization up to 57 bits to 60 bits. For 29 october there are 9970 such exponents.
HiddenWarrior is offline   Reply With Quote
Old 2003-10-29, 15:07   #2
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

769210 Posts
Default

HiddenWarrior, I think all those numbers are already being trial-factored by other people, so you would be duplicating some or all of their work needlessly.

The standard way of reserving ranges for LMH in order to avoid duplication is by exponent range and bit depth (like "xx.xM-yy.yM to 2^nn"), not just bit depth alone (as in "57 bits to 60 bits").

Please check this thread to see current ranges already assigned: List of LoneMersenneHunter ranges currently out. at http://mersenneforum.org/showthread.php?s=&threadid=384
cheesehead is offline   Reply With Quote
Old 2003-10-29, 15:17   #3
HiddenWarrior
 
HiddenWarrior's Avatar
 
Jun 2003
Russia, Novosibirsk

2·107 Posts
Default

Ok, I'll choose some range then!
HiddenWarrior is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
76.5-77M to 63 bits lycorn Lone Mersenne Hunters 2 2007-05-25 21:32
64 bits versus 32 bits Windows S485122 Software 2 2006-10-31 19:14
47.1M to 47.5M to 62 bits James Heinrich Lone Mersenne Hunters 2 2006-07-01 02:12
35-35.2 to 62 bits, cont from 61 bits Khemikal796 Lone Mersenne Hunters 12 2005-12-01 21:35
32.8 - 32.9 to 62 bits MrHappy Lone Mersenne Hunters 1 2005-08-04 16:36

All times are UTC. The time now is 13:14.


Fri Jul 7 13:14:56 UTC 2023 up 323 days, 10:43, 0 users, load averages: 1.38, 1.15, 1.11

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

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