Thread for posting tiny primes - Page 77

lorgix · 2010-10-19, 08:29

Quote:

Originally Posted by kar_bon

I've not yet displayed the -1 side of k*b^b+/-1, but all primes for k<=10000 and b<=1000 are known. Perhaps I can add those today.

The +1 side is avalaible here.

I kind of expected the form to be checked a little before.

Thanks for pointing them out.

cmd · 2010-10-19, 09:27

Scandinavia, be big

kar_bon · 2010-10-19, 09:29

Quote:

Originally Posted by kar_bon

The +1 side is avalaible here.

Now the -1 side is also available! See other thread, too.

3.14159 · 2010-10-19, 12:01

Quote:

Originally Posted by lorgix

I kind of expected the form to be checked a little before.

Thanks for pointing them out.

Yeah. It was kind of torture to do so.. Especially for 900 - 1000.

I think we can expand the database to k * 2000²⁰⁰⁰ + 1.

(This would be somewhere ≈6640-6645 digits)

lorgix · 2010-10-19, 12:55

Quote:

Originally Posted by 3.14159

Yeah. It was kind of torture to do so.. Especially for 900 - 1000.

I think we can expand the database to k * 2000²⁰⁰⁰ + 1.

(This would be somewhere ≈6640-6645 digits)

I started sieving 1050-1150, 10500-11500. Leaving a (few) gap(s) obv., guess I'll do that next if it's not already done by then.

science_man_88 · 2010-10-19, 20:05

Code:

for(i=2,#mersenne,print(isprime(floor(mersenne[i]^exp(1)/mersenne[i-1]))))

gives me false consistently. and I've tried up to exp(7) before i got mad at the time it took. what are the odds this can be used or applied. I'm not positive if i could prove for any value in exp() or not anyone trying to figure it out ?

CRGreathouse · 2010-10-19, 23:28

sm, I suspect this is because large numbers have small chances to be prime.

science_man_88 · 2010-10-20, 01:00

Quote:

Originally Posted by CRGreathouse

sm, I suspect this is because large numbers have small chances to be prime.

yeah I figured something out that invalidates me so far as i can test in a time I was willing to wait so my idea is flawed. wonder if anyone will find something really really fast lol.

3.14159 · 2010-10-20, 21:07

Quote:

Originally Posted by lorgix

I started sieving 1050-1150, 10500-11500. Leaving a (few) gap(s) obv., guess I'll do that next if it's not already done by then.

I'll take care of 1001-2000.

lorgix · 2010-10-21, 07:05

Quote:

Originally Posted by 3.14159

I'll take care of 1001-2000.

Ehm.. so.. everything?

3.14159 · 2010-10-21, 21:50

Quote:

Originally Posted by lorgix

Ehm.. so.. everything?

Yes.. I've done nearly everything so far.. Why not continue?

2010-10-19, 20:05	#842
science_man_88 "Forget I exist" Jul 2009 Dumbassville 2⁶×131 Posts	originally posted in Pari Commands Code: for(i=2,#mersenne,print(isprime(floor(mersenne[i]^exp(1)/mersenne[i-1])))) gives me false consistently. and I've tried up to exp(7) before i got mad at the time it took. what are the odds this can be used or applied. I'm not positive if i could prove for any value in exp() or not anyone trying to figure it out ?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Prime posting thread, part 2. (With a catch.)	3.14159	Miscellaneous Math	55	2010-11-19 23:55
Tiny range request .... 555.1M	petrw1	LMH > 100M	1	2010-07-13 15:35
Other primes thread	nuggetprime	No Prime Left Behind	32	2009-10-21 21:48
Error: tiny factoring failed	10metreh	Msieve	26	2009-03-08 23:28
Tiny error on nfsnet pages.	antiroach	NFSNET Discussion	1	2003-07-08 00:27

2010-10-19, 09:27	#838
cmd "(^r'°:.:)^n;e'e" Nov 2008 ;t:.:;^ 3³·37 Posts	Scandinavia, be big

2010-10-19, 23:28	#843
CRGreathouse Aug 2006 3·1,993 Posts	sm, I suspect this is because large numbers have small chances to be prime.