Thread for posting tiny primes - Page 46

science_man_88 · 2010-09-18, 18:08

Quote:

Originally Posted by 3.14159

Not for PARI. I already have one, but thanks anyway.

I meant, for PFGW.

I intend to continue for the collection of primes for k * 1296ⁿ + 1; k = 1 to 10k. I've almost collected every small prime for this range. (< 1000 digits.)

call a file with it in it ? calling files is pretty much all I've done in WinPFGW which I haven't done in a while.

rajula · 2010-09-18, 18:11

Quote:

Originally Posted by 3.14159

Also; I've saved myself about 2 days of testing time today.

Hey 3.14159,

based on your recent posting, I would suggest that you start, for example, writing a blog about your endeavor. Even if it might be of interest to someone, your posting does not seem to follow the spirit of this forum... As you can see for yourself, your posting is more or less a monograph.

(Please, do not take it as an offence. It is a suggestion, and anyways the moderators of this forum would do something if there was a real need for it. It might be just me who finds these chat-like one-liners to be inappropriate.)

3.14159 · 2010-09-18, 18:13

Quote:

Originally Posted by Rajula

based on your recent posting, I would suggest that you start, for example, writing a blog about your endeavor. Even if it might be of interest to someone, your posting does not seem to follow the spirit of this forum... As you can see for yourself, your posting is more or less a monograph.

Good idea. And, I think you mean, monologue*.

Alright; My first idea is to read the Scriptify documents. That might help.

Quote:

Originally Posted by Rajula

(Please, do not take it as an offence. It is a suggestion, and anyways the moderators of this forum would do something if there was a real need for it. It might be just me who finds these chat-like one-liners to be inappropriate.)

No offense taken.

science_man_88 · 2010-09-18, 18:39

Quote:

Originally Posted by 3.14159

Good idea. And, I think you mean, monologue*.

Alright; My first idea is to read the Scriptify documents. That might help.

No offense taken.

if you want help I know some html css and I have some javascript in memory and i have books on basic ruby / php as well

3.14159 · 2010-09-18, 18:41

For 10¹²²⁸⁸ + 1; Does one of these numbers divide it?

Code:

3.14159 · 2010-09-18, 18:42

Quote:

Originally Posted by science_man_88

if you want help I know some html css and I have some javascript in memory and i have books on basic ruby / php as well

Thanks, but, I have no idea of what PFGW's scripting is based on.

I think its scripting was based off Perl, if I remember correctly.

science_man_88 · 2010-09-18, 18:44

are they of a specific form ?

science_man_88 · 2010-09-18, 18:45

Quote:

Originally Posted by 3.14159

Thanks, but, I have no idea of what PFGW's scripting is based on.

I mean't with a blog lol.

3.14159 · 2010-09-18, 18:48

Quote:

Originally Posted by science_man_88

are they of a specific form ?

Like the original Primeform; any k * n + c expression, is my optimal choice for testing. I already have a simple script for PARI that tests any k * n + c;

Where one can choose the k/n ranges; and where k loops over each n; (Example; k * 5ⁿ + 1. We test k = 1 to 10000 for n = 70; Repeat with n = 71; Repeat with n = 72; etc, until the user-defined stop.)

Here are the results for k * 5ⁿ + 1, for n = 70, 71, 72; for k = 1 to 10000;

Code:

106*5^70+1
264*5^70+1
498*5^70+1
628*5^70+1
1092*5^70+1
1138*5^70+1
1174*5^70+1
1278*5^70+1
1372*5^70+1
1386*5^70+1
1728*5^70+1
2038*5^70+1
2044*5^70+1
2074*5^70+1
2086*5^70+1
2314*5^70+1
2566*5^70+1
2596*5^70+1
2608*5^70+1
2664*5^70+1
2682*5^70+1
2776*5^70+1
2832*5^70+1
3234*5^70+1
3366*5^70+1
6732*5^70+1
 - Cunningham chain 2nd kind -
3448*5^70+1
3502*5^70+1
3562*5^70+1
3724*5^70+1
4024*5^70+1
4176*5^70+1
4186*5^70+1
4206*5^70+1
4372*5^70+1
4404*5^70+1
4488*5^70+1
4506*5^70+1
4786*5^70+1
4968*5^70+1
5002*5^70+1
5164*5^70+1
5226*5^70+1
5476*5^70+1
5592*5^70+1
5704*5^70+1
5854*5^70+1
5934*5^70+1
6208*5^70+1
6312*5^70+1
6424*5^70+1
6556*5^70+1
6594*5^70+1
6658*5^70+1
6732*5^70+1
3366*5^70+1
 - Cunningham chain 2nd kind -
6784*5^70+1
7092*5^70+1
7146*5^70+1
7218*5^70+1
7218*5^70-1
 - Twin -
7282*5^70+1
7356*5^70+1
7356*5^70-1
 - Twin -
7552*5^70+1
7582*5^70+1
7678*5^70+1
7716*5^70+1
8028*5^70+1
8154*5^70+1
8254*5^70+1
8268*5^70+1
8332*5^70+1
8362*5^70+1
8422*5^70+1
8586*5^70+1
8638*5^70+1
9006*5^70+1
9024*5^70+1
9198*5^70+1
9232*5^70+1
9238*5^70+1
9282*5^70+1
9708*5^70+1
9742*5^70+1
38*5^71+1
594*5^71+1
704*5^71+1
776*5^71+1
854*5^71+1
876*5^71+1
966*5^71+1
998*5^71+1
1044*5^71+1
1172*5^71+1
1208*5^71+1
1232*5^71+1
1232*5^71+1 Divides Phi(5^71,2)
1286*5^71+1
1422*5^71+1
1758*5^71+1
1946*5^71+1
2076*5^71+1
2132*5^71+1
2306*5^71+1
2496*5^71+1
2558*5^71+1
2658*5^71+1
2924*5^71+1
2948*5^71+1
3018*5^71+1
3056*5^71+1
3084*5^71+1
3086*5^71+1
3122*5^71+1
3224*5^71+1
3332*5^71+1
3398*5^71+1
3578*5^71+1
3606*5^71+1
3644*5^71+1
4418*5^71+1
4464*5^71+1
4752*5^71+1
4788*5^71+1
4812*5^71+1
5004*5^71+1
5072*5^71+1
5124*5^71+1
10248*5^71+1
 - Cunningham chain 2nd kind -
5198*5^71+1
5204*5^71+1
5382*5^71+1
5478*5^71+1
5526*5^71+1
5922*5^71+1
6122*5^71+1
6468*5^71+1
6528*5^71+1
6564*5^71+1
6746*5^71+1
7038*5^71+1
7104*5^71+1
7134*5^71+1
7154*5^71+1
7188*5^71+17508*5^71+1
7656*5^71+1
7784*5^71+1
8036*5^71+1
8154*5^71+1
8226*5^71+1
8306*5^71+1
8366*5^71+1
8504*5^71+1
8652*5^71+1
8652*5^71-1
 - Twin -
8798*5^71+1
8834*5^71+1
8852*5^71+1
9366*5^71+1
9402*5^71+1
9428*5^71+1
9434*5^71+1
9798*5^71+1
9828*5^71+1
9866*5^71+1
9926*5^71+1
78*5^72+1
192*5^72+1
234*5^72+1
252*5^72+1
394*5^72+1
408*5^72+1
864*5^72+1
978*5^72+1
1194*5^72+1
1278*5^72+1
1326*5^72+1
1372*5^72+1
1578*5^72+1
1648*5^72+1
1696*5^72+1
2028*5^72+1
2038*5^72+1
2082*5^72+1
2142*5^72+1
2172*5^72+1
2356*5^72+1
2418*5^72+1
2566*5^72+1
2686*5^72+1
2854*5^72+1
3048*5^72+1
3264*5^72+1
3294*5^72+1
3598*5^72+1
3636*5^72+1
3658*5^72+1
3684*5^72+1
3694*5^72+1
3718*5^72+1
3762*5^72+1
3844*5^72+1
3904*5^72+1
3948*5^72+1
4002*5^72+1
4036*5^72+1
4168*5^72+1
4294*5^72+1
4998*5^72+1
5092*5^72+1
5178*5^72+1
5226*5^72+1
5614*5^72+1
5664*5^72+1
5728*5^72+1
5898*5^72+1
5916*5^72+1
5922*5^72+1
5974*5^72+1
6118*5^72+1
6708*5^72+1
6846*5^72+1
6892*5^72+1
7338*5^72+1
7438*5^72+1
7486*5^72+1
7488*5^72+1
7648*5^72+1
7686*5^72+1
7798*5^72+1
7848*5^72+1
15696*5^72+1
 - Cunningham chain 2nd kind -
7908*5^72+1
8002*5^72+1
8148*5^72+1
8638*5^72+1
8718*5^72+1
8736*5^72+1
8932*5^72+1
8934*5^72+1
9018*5^72+1
9048*5^72+1
9072*5^72+1
9226*5^72+1
9264*5^72+1
9276*5^72+1
9348*5^72+1
9378*5^72+1
9492*5^72+1
9564*5^72+1
9612*5^72+1

science_man_88 · 2010-09-18, 18:50

Quote:

Originally Posted by 3.14159

Like the original Primeform; any k * n + c numbers, is my optimal choice for testing. I already have a simple script for PARI that tests any k * n + c;

I mean't for your question about

10^12288 + 1

3.14159 · 2010-09-18, 18:54

They are all Proth numbers; GFNs are divided by Proth numbers. Curiously, I think 10¹²²⁸⁸ + 1 has no small divisors.

2010-09-18, 18:54	#506
3.14159 May 2010 Prime hunting commission. 2⁴·3·5·7 Posts	They are all Proth numbers; GFNs are divided by Proth numbers. Curiously, I think 10¹²²⁸⁸ + 1 has no small divisors. Last fiddled with by 3.14159 on 2010-09-18 at 18:59

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-09-18, 18:44	#502
science_man_88 "Forget I exist" Jul 2009 Dumbassville 2⁶·131 Posts	are they of a specific form ?