mersenneforum.org  

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

Reply
 
Thread Tools
Old 2020-09-10, 16:14   #1
StrongestStrike
 
Sep 2020

7 Posts
Default Changing work order of program

In recent days, I have been studying the properties of the equation for \(m^n+h \equiv 0 \pmod n\) where \(m,n \in \mathbb N\) and \(h \in \mathbb Z\), and I wanted to use the Prime95 program to calculate the factors of some of the numbers in the above form(specifically those of the form \(2^n+1\) where n satisfies \(n|2^n+1\)). However, I have already been assigned exponents from the GIMPS that would take months to complete. How can I change the order of queued work so that I can commence factorization of my desired numbers first?
StrongestStrike is offline   Reply With Quote
Old 2020-09-10, 16:19   #2
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

17·263 Posts
Default Briefly

Stop Prime95
Edit worktodo.txt and arrange assignments as you want
Start Prime95
petrw1 is offline   Reply With Quote
Old 2020-09-11, 03:20   #3
StrongestStrike
 
Sep 2020

7 Posts
Default

Thanks for the help.
StrongestStrike is offline   Reply With Quote
Old 2020-09-11, 09:57   #4
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

22×2,239 Posts
Default

How big the numbers?
yafu or pfgw could be a MUCH better (and faster) choice. P95 is not exactly designed for "factoring".

Last fiddled with by LaurV on 2020-09-11 at 09:58
LaurV is offline   Reply With Quote
Old 2020-09-14, 15:01   #5
StrongestStrike
 
Sep 2020

716 Posts
Default

I have just downloaded PFGW, yet even after reading the instructions, I can't seem to understand how to perform commands in the project. (By the way, my first number for factoring is 2^2197+1, since all n<=1539 had already been fully factored.)

Last fiddled with by StrongestStrike on 2020-09-14 at 15:02
StrongestStrike is offline   Reply With Quote
Old 2020-09-14, 15:24   #6
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
U.S.A.

2×7×112 Posts
Default

Quote:
Originally Posted by StrongestStrike View Post
I have just downloaded PFGW, yet even after reading the instructions, I can't seem to understand how to perform commands in the project. (By the way, my first number for factoring is 2^2197+1, since all n<=1539 had already been fully factored.)

If you go to Prime Wiki, you will be able to sift through what is available.
storm5510 is offline   Reply With Quote
Old 2020-09-14, 16:49   #7
thyw
 
Feb 2016
! North_America

2·37 Posts
Default

Quote:
Originally Posted by StrongestStrike View Post
I have just downloaded PFGW, yet even after reading the instructions, I can't seem to understand how to perform commands in the project. (By the way, my first number for factoring is 2^2197+1, since all n<=1539 had already been fully factored.)
PFGW is mainly used to tell you if the number inputted is prime or not. (It can include some factoring, but that isn't the focus.)
Use YAFU for factoring. I found it much easier to use as it automates lot of things i do not know enough about.

(GUI version, Windows openPFGW) The short and simple version as far as i could understand, is having the number in plain form (2^4 -> 16) in a text file, then inputting the name of the text file into the big field, then hitting start.
Or "pfgw file.txt" for the command line version.

Last fiddled with by thyw on 2020-09-14 at 16:50
thyw is offline   Reply With Quote
Old 2020-09-15, 04:30   #8
StrongestStrike
 
Sep 2020

7 Posts
Default

It seems that YAFU is a Microsoft Windows application, and thus I, as a MacOS user, can not access it, due to me not being able to clear enough stoarge for installation of Windows 10. Is there any way to solve this problem?
StrongestStrike is offline   Reply With Quote
Old 2020-09-15, 15:26   #9
chris2be8
 
chris2be8's Avatar
 
Sep 2009

2·7·139 Posts
Default

Quote:
Originally Posted by StrongestStrike View Post
By the way, my first number for factoring is 2^2197+1, since all n<=1539 had already been fully factored.
2^2197+1 is much too big to factor with yafu on a single computer. It would need a large supercomputer to do in a reasonable time such as a few years.

The first step for 2^n+1 or 2^n-1 is to look it up in http://factordb.com/ and see if it's fully factored. If not it will be a very big job to factor. Sorry to be so discouraging but you would be wasting time trying to factor it with yafu.

If you want to install yafu try it's thread: https://mersenneforum.org/forumdisplay.php?f=96

Chris
chris2be8 is offline   Reply With Quote
Old 2020-09-19, 05:51   #10
StrongestStrike
 
Sep 2020

7 Posts
Default New results on factoring 2^2187+1

A few days ago, I have finally found how to find new factors using Prime95 without re-finding old ones, and I have found a new prime factor of c400 (previously the only factor not yet fully factorized), which is 6326666886932800988419273258756815291776881. Thus, the composite factor is now reduced to c357. (It seems that I have made a mistake in one of my previous thread, since I tend to mix up 2187(3^7) and 2197(13^3) quite often.)

Last fiddled with by StrongestStrike on 2020-09-19 at 05:52
StrongestStrike is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
order of a function =/= p-1 bhelmes Math 5 2018-09-13 16:23
ECM curve group order Brain Miscellaneous Math 1 2010-12-08 01:00
Number of groups for given order Raman Puzzles 6 2010-09-05 17:43
Forum order? Xyzzy Forum Feedback 5 2007-01-28 10:35
A property about the order of divisors of (Mq-1)/2 T.Rex Math 3 2005-11-14 18:23

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

Wed Dec 2 07:22:15 UTC 2020 up 83 days, 4:33, 1 user, load averages: 1.44, 1.35, 1.41

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