distribution of remaining candidates

2003-10-10, 05:42

paul, could you give us a table with

range of 1000 | remaining candidates
700 | 75
701 | 69
....
999 | 81

you knpw what i mean?
the more remaining candidates in a range, the bigger the chance of a prime!

thommy

paulunderwood · 2003-10-10, 07:20

Here it is:

moved to here

2003-10-10, 11:30

the tops are:

707 89
748 83
849 81
934 80

the bottoms:

852 45
860 45
749 46
901 47

i bet there is a prime in at least one block of the top 4. no doubt about it.

paulunderwood · 2003-10-10, 14:28

I have some doubt! I just hope we find another prime before n=1,000,000. Even two!

Everyone is free to "cherry pick" ranges. The time taken to test the smaller numbers is less.

Perhaps some people will join in and bring with them their beginners luck!

paulunderwood · 2003-10-16, 21:18

I will be releasing all remaining candidate prime numbers in blocks of a 1000 range.

At n=700,000 a block of a 1000 range will take about 4-5 days on a P4 @ 2.4GHz -- take into consideration the above table. I will try out a high block after I have finshed my current block.

I will maintain the above table so that it reflects what is left

Citrix · 2003-10-18, 04:44

Once some of the lower candidates have been removed sieving again can reduce few more candidates. Also other methods should be tried to factor these numbers like P-1 and ECM.

Good Luck with the project!
I also hope you find 2 primes!

Citrix

paulunderwood · 2003-10-18, 15:45

Quote:

Once some of the lower candidates have been removed sieving again can reduce few more candidates.

We are through with sieving. There is no point sieving further because we reached the limit of effectiveness of sieving.

Quote:

Also other methods should be tried to factor these numbers like P-1 and ECM.

If the were a program I could run against the remaining candates I would use it. Is there a P-1 program that can cope with 200,000+ digit numbers? If so where is it and how do I use it?

Citrix · 2003-10-18, 21:26

Paul,
You will have to write one for yourself. The algorithm of p-1 is really simple but to optimize it for large numbers is the tricky part. The GIPMS and the SOB project use this code, you could ask them to share their source with you or modify their p-1 client for you.

Good luck!

Citrix

wblipp · 2003-10-19, 00:39

Quote:

Originally posted by paulunderwood
Is there a P-1 program that can cope with 200,000+ digit numbers? If so where is it and how do I use it?

The GMP-ECM program will do P-1 and P+1 for numbers of this size. For numbers with millions of digits you will need to recompile following the instructions. But I just checked a number with 220000 digits using the GMP-ECM5 beta that is in the files section for the Yahoo PrimeNumbers Group. This is the version used by ElevenSmooth, so you could also get it from the ElevenSmooth Download Page.

Citrix · 2003-10-19, 00:50

wblipp,
Is the code optamized for such large numbers? Specially for numbers base 2.

Citrix

paulunderwood · 2003-10-19, 01:05

How do I perform p-1 only with ecm?

wblipp, how did you run your run? I want to input a file of numbers.

2003-10-10, 05:42	#1
thommy 2×5×877 Posts	distribution of remaining candidates paul, could you give us a table with range of 1000 \| remaining candidates 700 \| 75 701 \| 69 .... 999 \| 81 you knpw what i mean? the more remaining candidates in a range, the bigger the chance of a prime! thommy

2003-10-10, 07:20	#2
paulunderwood Sep 2002 Database er0rr 3739₁₀ Posts	Here it is: moved to here Last fiddled with by paulunderwood on 2003-11-21 at 20:45

2003-10-10, 11:30	#3
thommy 2·4,217 Posts	thanks the tops are: 707 89 748 83 849 81 934 80 the bottoms: 852 45 860 45 749 46 901 47 i bet there is a prime in at least one block of the top 4. no doubt about it.

2003-10-18, 04:44	#6
Citrix Jun 2003 2×7×113 Posts	Other methods to sieve Once some of the lower candidates have been removed sieving again can reduce few more candidates. Also other methods should be tried to factor these numbers like P-1 and ECM. Good Luck with the project! I also hope you find 2 primes! Citrix

2003-10-18, 21:26	#8
Citrix Jun 2003 3056₈ Posts	P-1 Paul, You will have to write one for yourself. The algorithm of p-1 is really simple but to optimize it for large numbers is the tricky part. The GIPMS and the SOB project use this code, you could ask them to share their source with you or modify their p-1 client for you. Good luck! Citrix

2003-10-10, 14:28	#4
paulunderwood Sep 2002 Database er0rr 3,739 Posts	I have some doubt! I just hope we find another prime before n=1,000,000. Even two! Everyone is free to "cherry pick" ranges. The time taken to test the smaller numbers is less. Perhaps some people will join in and bring with them their beginners luck!

2003-10-16, 21:18	#5
paulunderwood Sep 2002 Database er0rr 3,739 Posts	I will be releasing all remaining candidate prime numbers in blocks of a 1000 range. At n=700,000 a block of a 1000 range will take about 4-5 days on a P4 @ 2.4GHz -- take into consideration the above table. I will try out a high block after I have finshed my current block. I will maintain the above table so that it reflects what is left

2003-10-19, 00:50	#10
Citrix Jun 2003 62E₁₆ Posts	optimized? wblipp, Is the code optamized for such large numbers? Specially for numbers base 2. Citrix

2003-10-19, 01:05	#11
paulunderwood Sep 2002 Database er0rr 3,739 Posts	How do I perform p-1 only with ecm? wblipp, how did you run your run? I want to input a file of numbers.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Conjectures with one k remaining	rogue	Conjectures 'R Us	109	2017-04-29 01:28
P-1 factoring attempts at smallest-remaining Mersenne numbers with no known factors	UberNumberGeek	Factoring	51	2017-02-13 20:30
20 Easy Pieces - The Remaining 29-bit Jobs	swellman	XYYXF Project	5	2016-02-27 22:35
Discussion about CPU time needed and k's remaining	Siemelink	Conjectures 'R Us	41	2008-07-11 23:05
Easiest Remaining Cunninghams	R.D. Silverman	Factoring	1	2008-03-12 03:34