mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Miscellaneous Math (https://www.mersenneforum.org/forumdisplay.php?f=56)
-   -   Thread for posting tiny primes (https://www.mersenneforum.org/showthread.php?t=13650)

lorgix 2010-10-19 08:29

[QUOTE=kar_bon;233838]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 [URL="http://www.rieselprime.de/Others/kbbp.htm"]here[/URL].[/QUOTE]

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=kar_bon;233838]The +1 side is avalaible [url=www.rieselprime.de/Others/kbbp.htm]here[/url].[/QUOTE]

Now the -1 side is also available! See other [url=http://www.mersenneforum.org/showthread.php?t=13797]thread[/url], too.

3.14159 2010-10-19 12:01

[QUOTE=lorgix;233839]I kind of expected the form to be checked a little before.

Thanks for pointing them out.[/QUOTE]


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

I think we can expand the database to k * 2000[sup]2000[/sup] + 1.

(This would be somewhere ≈6640-6645 digits)

lorgix 2010-10-19 12:55

[QUOTE=3.14159;233854]Yeah. It was kind of torture to do so.. Especially for 900 - 1000.

I think we can expand the database to k * 2000[sup]2000[/sup] + 1.

(This would be somewhere ≈6640-6645 digits)[/QUOTE]

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

originally posted in Pari Commands
 
[CODE]for(i=2,#mersenne,print(isprime(floor(mersenne[i]^exp(1)/mersenne[i-1]))))[/CODE]

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=CRGreathouse;233937]sm, I suspect this is because large numbers have small chances to be prime.[/QUOTE]

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=lorgix;233860]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.[/QUOTE]

I'll take care of 1001-2000.

lorgix 2010-10-21 07:05

[QUOTE=3.14159;234021]I'll take care of 1001-2000.[/QUOTE]

Ehm.. so.. everything?

3.14159 2010-10-21 21:50

[QUOTE=lorgix;234056]Ehm.. so.. everything?[/QUOTE]

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


All times are UTC. The time now is 15:01.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.