mersenneforum.org  

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

Reply
 
Thread Tools
Old 2003-07-15, 01:54   #1
antiroach
 
antiroach's Avatar
 
Jun 2003

22·61 Posts
Default trial factoring of "small" mersenne numbers

i noticed that there are many "small" mersenne numbers that have only been trial divided upto 57 bits. (decomp -w 1 100000) for example. I tried to trial factor them (upto 58 bits) just for the heck of it but prime95 wouldnt let me. It said it was a bad factoring assignment. Anyone know why this is happening? Thanks.
antiroach is offline   Reply With Quote
Old 2003-07-15, 05:00   #2
NickGlover
 
NickGlover's Avatar
 
Aug 2002
Richland, WA

8416 Posts
Default

I believe you need to set FactorOverride=58 in prime.ini .

The reason you get "bad factoring assignment" is that default factoring depth for an exponent around 1 million is much lower than 57 bits, so Prime95 doesn't think there is any work to do on the exponent.
NickGlover is offline   Reply With Quote
Old 2003-07-15, 05:40   #3
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22·3·641 Posts
Default Re: trial factoring of "small" mersenne numbers

Quote:
Originally Posted by antiroach
i noticed that there are many "small" mersenne numbers that have only been trial divided upto 57 bits. (decomp -w 1 100000) for example. I tried to trial factor them (upto 58 bits) just for the heck of it
I hope you're aware that trial-factoring a small Mnumber from 2^57 to 2^58 takes _longer_ than TFing a large Mnumber from 2^57 to 2^58, and that the ratio is roughly the inverse of the ratio of exponents. That is, it takes in the neighborhood of 100 times as long to TF 2^9xxxx-1 from 2^57 to 2^58 as it does to TF 2^9xxxxxx-1 from 2^57 to 2^58. That ratio is offset by a mildly faster TF iteration speed for the smaller Mnumber, but that offset is of a lower order than the exponent ratio.
cheesehead is offline   Reply With Quote
Old 2003-07-15, 11:50   #4
eepiccolo
 
eepiccolo's Avatar
 
Dec 2002
Frederick County, MD

2·5·37 Posts
Default

Also, reference this post for another reason you shouldn't TF the smaller numbers.

http://www.mersenneforum.org/viewtopic.php?t=415
eepiccolo is offline   Reply With Quote
Old 2003-07-15, 16:56   #5
antiroach
 
antiroach's Avatar
 
Jun 2003

F416 Posts
Default

wow, thanks for all the replies. i did set factoroverride, but i had no idea that it takes longer to trial factor smaller numbers. I wasn't really planning on trial factoring those numbers since an first time LL and a double check were already performed on these numbers. I was just wondering why prime95 wouldn't even let me do it.
antiroach is offline   Reply With Quote
Old 2003-07-15, 17:50   #6
NickGlover
 
NickGlover's Avatar
 
Aug 2002
Richland, WA

22·3·11 Posts
Default

I just tested to make sure and it does work. I randomly chose 944821 from the nofactor file. My worktodo.ini has Factor=944821,57 and I set FactorOverride=58 in prime.ini . Make certain to restart Prime95 after making changes to prime.ini .
NickGlover is offline   Reply With Quote
Old 2003-07-16, 23:35   #7
antiroach
 
antiroach's Avatar
 
Jun 2003

22·61 Posts
Default

i have only tested it upto 100,000. I havent bothered trying to trial factor anything above that. :)
antiroach is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
"factoring" vs "factorizing" ixfd64 Factoring 4 2012-10-16 04:07
"On factors of Mersenne numbers" - Seiji Tomita cheesehead Math 6 2009-12-15 17:45
Algorithms for "small" numbers? Jushi Factoring 2 2006-03-12 12:10
request: always include "from" in trial-factoring results James Heinrich Software 1 2005-04-10 02:44
P-1 factoring != "Mersenne numbers to factor"? James Heinrich Marin's Mersenne-aries 8 2004-05-17 11:09

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


Fri Jun 9 13:56:22 UTC 2023 up 295 days, 11:24, 0 users, load averages: 0.76, 0.88, 0.94

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.

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