How can I enter a larger exponent?

evanh · 2017-12-23, 06:19

When I try to enter a larger exponent under Advanced>Test

I am limited to 560,000,000 I believe, from what I read in the .txt files.
however, I see under recent results that people are capable of running higher exponents. How can I do this? I would like to run a random/shot in the dark/swingforthefences exponent of my own... a 1Billion digit exponent..

I would like to enter my own exponent once one of my workers finishes its current task.

thanks

chalsall · 2017-12-23, 06:35

Quote:

Originally Posted by evanh

I would like to enter my own exponent once one of my workers finishes its current task.

Stop worker.

Take head and insert into your own ass.

Start worker.

CRGreathouse · 2017-12-23, 07:28

Please be kind.

axn · 2017-12-23, 07:32

Quote:

Originally Posted by evanh

a 1Billion digit exponent..

Why don't you start with a 100M digit one? It is also eligible for the EFF prize, and takes only 1/100th the time for a billion digit one. It is also 10 times likelier to be prime that a billion digit one! Talk about win-win. Once you've finished one of those, we'll talk about running a multi-decade test, ok?

retina · 2017-12-23, 08:02

Quote:

Originally Posted by evanh

my own... a 1Billion digit exponent..

You might not live long enough to see it finish unless you have a very fast machine.

Plus the limit is there for a good reason; P95 can't test numbers that large. You'll need different software for a number of that size.

R. Gerbicz · 2017-12-23, 08:29

Quote:

Originally Posted by evanh

When I try to enter a larger exponent under Advanced>Test

I am limited to 560,000,000
(...)
I would like to run a random/shot in the dark/swingforthefences exponent of my own... a 1Billion digit exponent..

That is a large overshoot, do you really want that? The largest known Mersenne prime has only 8 digits long in exponent (in base ten).

ET_ · 2017-12-23, 11:53

Quote:

Originally Posted by R. Gerbicz

That is a large overshoot, do you really want that? The largest known Mersenne prime has only 8 digits long in exponent (in base ten).

evanh · 2017-12-23, 16:05

Quote:

Originally Posted by CRGreathouse

Please be kind.

thanks

evanh · 2017-12-23, 16:07

Quote:

Originally Posted by chalsall

Stop worker.

Take head and insert into your own ass.

Start worker.

thats pretty ineffiicient. There is no need to stop my current workers to do that... I have a big head it may take a while to insert, thats time wasted on my current exponents

petrw1 · 2017-12-23, 16:47

Quote:

Originally Posted by evanh

When I try to enter a larger exponent under Advanced>Test

I am limited to 560,000,000 I believe, from what I read in the .txt files.
however, I see under recent results that people are capable of running higher exponents. How can I do this? I would like to run a random/shot in the dark/swingforthefences exponent of my own... a 1Billion digit exponent..

I would like to enter my own exponent once one of my workers finishes its current task.

thanks

Prime95 is limited to 560M.
Results you see for larger exponents are using different software of which I have no experience. As well I believe those who are trying are using LL testing software on their GPUs.

But as several have said; you truly may not live to see it complete unless you have a super computer or very fast GPU.

Check out any of these that have LL as the Work Type and that have a completion date.
https://www.mersenne.org/assignments...&exp1=1&extf=1

evanh · 2017-12-23, 17:13

Since I am not sure what you mean by "fast" here are my specs. No I do not have a supercomputer or anything of that nature. just a couple of Macs.

desktop:
iMac: 4 GHz Intel Core i7, 32 GB 1600 MHz DDR3, AMD Radeon R9 M295X 4 GB

laptop:
MacBook Pro: 3.1 GHz Intel Core i7,16 GB 2133 MHz LPDDR3, Intel HD Graphics 630 1536

To be quite honest I found a way to land on a prime number relatively quickly(at least for numbers with a number of digits that I can test personally), however, it is not in the form $2^P-1$ ..... which means I could very likely land on a prime that is 100,000,000 digits long NOT in the form $2^P-1$ with ridiculously fewer computations .....<100 computations perhaps... while something like Prime95 keeps chugging along.

I thought I was good to go but then I ran into any issue with the computational mathematics software I use, Maplesoft's Maple. I am not actually coding in Maple's language(yet) just inputing my commands into worksheet mode.... symbolically? << right word

Its not an error on their part its just how their program is written. They have 2 prime functions of interest.

The first is isprime(integer) and it returns true or false. Maplesoft's help pages state that this is a probabilistic primality testing routine that does a "strong pseudo-primality test" and a one Lucas test.

The second is type(expr, prime) which apparently just checks to see if an integer is inputed and runs a "true" primality test up until you input a certain length of digit, then it defaults back to isprime(integer)

before I could even enter an exponent of my own I would have to find such a number that could be put in the form $2^P-1$ which is my first problem because my number would not initially be in such a form. it would be more like $2^x-C$ where x a specific number(likely not prime) and C is a constant chosen from the method I would employ.

There is nothing wrong with Prime95 as it has obviously proven itself. However, upon reading the rules of the EFF for the 100,000,000+ & 1,000,000,000+ digit awards I do not recall anything stating that the prime must be in the form of a Mersenne Prime

It would be great if I knew how to code and could write my own program where I could input one of these numbers and check to see if its prime but I am just now working on this aspect of my personal portfolio. My first programming class is "Intro to C-Programming" and it starts in about 3 weeks

The problem with Maplesoft's program, again for my purposes not a flaw on their product, is that it doesn't provide any time references for completion, doesn't save progress, and just simply states "evaluating" .... I managed to get it to spit out a 600,000,000 digit long number but above that it appears that it doesn't like me lol

I almost forgot.. when I check my method through Maplesoft using smaller digit primes I always return a "true" for the prime check within 100 computations, most of the checks involve less than 40 computations...

I am currently a double major working towards a B.S. in Mathematics & Physics with about 2 years left.I will pursue a graduate degree in either: Mathematical Physics or Applied Physics concentrated in Applied Mathematics & Computational Physics... which is why I am learning with Maplesoft :)

Again, almost forgot.... I am one of the recipients at my university of our NSF-STEM Scholarship and I must do at least one research project and I was considering doing research into my method of locating primes... I guess the big question that I must answer before I go down this road is what benefit could my method have over any other method...

2017-12-23, 06:19	#1
evanh "Evan" Dec 2017 Houston, TX 36₈ Posts	How can I enter a larger exponent? When I try to enter a larger exponent under Advanced>Test I am limited to 560,000,000 I believe, from what I read in the .txt files. however, I see under recent results that people are capable of running higher exponents. How can I do this? I would like to run a random/shot in the dark/swingforthefences exponent of my own... a 1Billion digit exponent.. I would like to enter my own exponent once one of my workers finishes its current task. thanks

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
How to enter password in prime.txt?	Unregistered	Information & Answers	3	2011-04-28 02:02
Less GHz days for larger exponents in TF?	Bdot	Information & Answers	12	2010-11-21 22:33
Enter key doesn't work at weird times.	jasong	Linux	5	2007-08-25 20:31
How 'bout an ecm server for numbers about to enter Prime95 first-pass?	jasong	GMP-ECM	2	2007-03-16 16:16
2003 Nov 03: P-1: a set of 16 larger exponents	GP2	Completed Missions	2	2003-11-09 01:21

2017-12-23, 07:28	#3
CRGreathouse Aug 2006 3×1,993 Posts	Please be kind.

2017-12-23, 17:13	#11
evanh "Evan" Dec 2017 Houston, TX 2·3·5 Posts	Since I am not sure what you mean by "fast" here are my specs. No I do not have a supercomputer or anything of that nature. just a couple of Macs. desktop: iMac: 4 GHz Intel Core i7, 32 GB 1600 MHz DDR3, AMD Radeon R9 M295X 4 GB laptop: MacBook Pro: 3.1 GHz Intel Core i7,16 GB 2133 MHz LPDDR3, Intel HD Graphics 630 1536 To be quite honest I found a way to land on a prime number relatively quickly(at least for numbers with a number of digits that I can test personally), however, it is not in the form $2^P-1$ ..... which means I could very likely land on a prime that is 100,000,000 digits long NOT in the form $2^P-1$ with ridiculously fewer computations .....<100 computations perhaps... while something like Prime95 keeps chugging along. I thought I was good to go but then I ran into any issue with the computational mathematics software I use, Maplesoft's Maple. I am not actually coding in Maple's language(yet) just inputing my commands into worksheet mode.... symbolically? << right word Its not an error on their part its just how their program is written. They have 2 prime functions of interest. The first is isprime(integer) and it returns true or false. Maplesoft's help pages state that this is a probabilistic primality testing routine that does a "strong pseudo-primality test" and a one Lucas test. The second is type(expr, prime) which apparently just checks to see if an integer is inputed and runs a "true" primality test up until you input a certain length of digit, then it defaults back to isprime(integer) before I could even enter an exponent of my own I would have to find such a number that could be put in the form $2^P-1$ which is my first problem because my number would not initially be in such a form. it would be more like $2^x-C$ where x a specific number(likely not prime) and C is a constant chosen from the method I would employ. There is nothing wrong with Prime95 as it has obviously proven itself. However, upon reading the rules of the EFF for the 100,000,000+ & 1,000,000,000+ digit awards I do not recall anything stating that the prime must be in the form of a Mersenne Prime It would be great if I knew how to code and could write my own program where I could input one of these numbers and check to see if its prime but I am just now working on this aspect of my personal portfolio. My first programming class is "Intro to C-Programming" and it starts in about 3 weeks The problem with Maplesoft's program, again for my purposes not a flaw on their product, is that it doesn't provide any time references for completion, doesn't save progress, and just simply states "evaluating" .... I managed to get it to spit out a 600,000,000 digit long number but above that it appears that it doesn't like me lol I almost forgot.. when I check my method through Maplesoft using smaller digit primes I always return a "true" for the prime check within 100 computations, most of the checks involve less than 40 computations... I am currently a double major working towards a B.S. in Mathematics & Physics with about 2 years left.I will pursue a graduate degree in either: Mathematical Physics or Applied Physics concentrated in Applied Mathematics & Computational Physics... which is why I am learning with Maplesoft :) Again, almost forgot.... I am one of the recipients at my university of our NSF-STEM Scholarship and I must do at least one research project and I was considering doing research into my method of locating primes... I guess the big question that I must answer before I go down this road is what benefit could my method have over any other method...