mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2022-06-18, 20:01   #1
mikedons
 
Nov 2021

2 Posts
Default Question on "ECM on Mersenne cofactor" work type

I set Prime95 up to do the "ECM on Mersenne cofactor" work type and was sort of expecting that I would get an assignment that ran ECM on a cofactor of a Mersenne number many times, until it was deemed unproductive to continue. What actually happens is that I get an assignment to do ECM on a Mersenne number once, then it moves on to a different Mersenne number.

Using M2106347 as an example (approx 700000 decimal digits if my maths is correct), it has 4 known factors totalling about 50 decimal digits, so the remaining unfactored amount is relatively speaking a similar size to M2106347. Is this why we just repeat the ECM on M2106347 instead of on the unfactored amount?

I still don't understand the apparent scatter gun approach where I get assigned 1 attempt at many different exponents (rather than repeatedly trying to factor the same number).
mikedons is offline   Reply With Quote
Old 2022-06-19, 04:17   #2
axn
 
axn's Avatar
 
Jun 2003

22×7×193 Posts
Default

Quote:
Originally Posted by mikedons View Post
Using M2106347 as an example (approx 700000 decimal digits if my maths is correct), it has 4 known factors totalling about 50 decimal digits, so the remaining unfactored amount is relatively speaking a similar size to M2106347. Is this why we just repeat the ECM on M2106347 instead of on the unfactored amount?
It is more efficient to use the full mersenne number for the FFT operations (because of its special form) rather than just the unfactored part. In fact, even if the unfactored part was just half the size as the mersenne number, it would still be efficient to use the full number. However, rest assured, it will use the known factors while computing gcd so that only new factors will be reported. You're not losing anything.


Quote:
Originally Posted by mikedons View Post
I still don't understand the apparent scatter gun approach where I get assigned 1 attempt at many different exponents (rather than repeatedly trying to factor the same number).
Depth-first vs breadth-first search. Your best bet of finding a factor is to run ECM on the least ECM-ed number. Server will keep track.
axn is offline   Reply With Quote
Old 2022-06-19, 08:23   #3
mikedons
 
Nov 2021

2 Posts
Default

Thank you.
mikedons is offline   Reply With Quote
Old 2022-06-26, 11:49   #4
piforbreakfast
 
Oct 2020
Terre Haute, IN

7916 Posts
Default

Quote:
Originally Posted by axn View Post
It is more efficient to use the full mersenne number for the FFT operations (because of its special form) rather than just the unfactored part. In fact, even if the unfactored part was just half the size as the mersenne number, it would still be efficient to use the full number. However, rest assured, it will use the known factors while computing gcd so that only new factors will be reported. You're not losing anything.



Depth-first vs breadth-first search. Your best bet of finding a factor is to run ECM on the least ECM-ed number. Server will keep track.
I've wondered for some time, what is the purpose in factoring numbers that have been found to be non-prime but which have not been fully factored?
piforbreakfast is offline   Reply With Quote
Old 2022-06-26, 12:56   #5
BudgieJane
 
BudgieJane's Avatar
 
"Jane Sullivan"
Jan 2011
Beckenham, UK

32×5×7 Posts
Default

Quote:
Originally Posted by piforbreakfast View Post
I've wondered for some time, what is the purpose in factoring numbers that have been found to be non-prime but which have not been fully factored?
It's the same as climbing Everest, or other mountains that have been climbed before: "Because it's there."
BudgieJane is offline   Reply With Quote
Old 2022-06-26, 13:29   #6
axn
 
axn's Avatar
 
Jun 2003

22·7·193 Posts
Default

Quote:
Originally Posted by piforbreakfast View Post
I've wondered for some time, what is the purpose in factoring numbers that have been found to be non-prime but which have not been fully factored?
We get a shot at fully factoring them. They have some mathematical uses (or so I've been told), but is also a fun challenge. See https://www.mersenne.ca/prp.php for the current list of fully factored Mersenne numbers.

Last fiddled with by axn on 2022-06-26 at 13:29
axn is offline   Reply With Quote
Old 2022-06-26, 17:07   #7
mathwiz
 
Mar 2019

30210 Posts
Default

Quote:
Originally Posted by piforbreakfast View Post
I've wondered for some time, what is the purpose in factoring numbers that have been found to be non-prime but which have not been fully factored?
This is a good page with some answers to "why do we do X", where X could be prime hunting, factoring, etc. Ultimately it's your machine and your cycles, so you get to decide what seems most fun and rewarding to participate in.
mathwiz is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Work not reflected in personal "CPUs" list gpbc12 Information & Answers 6 2020-07-15 01:44
"Start at Bootup" option didn't work on Windows XP machine? ixfd64 Software 1 2014-12-31 17:14
Refurb. Mac emits "Bad CPU type in executable" error ewmayer Hardware 15 2014-08-11 22:03
Work types in "Computers and Notes" table Chuck GPU to 72 3 2012-08-25 03:10
What is work type "LL Test with no factoring"? Svenie25 PrimeNet 4 2011-02-22 20:08

All times are UTC. The time now is 00:35.


Mon Sep 26 00:35:06 UTC 2022 up 38 days, 22:03, 0 users, load averages: 1.51, 1.16, 1.18

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.

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