Thread: New Computation
View Single Post
Old 2011-07-12, 19:37   #6
JohnFullspeed
 
May 2011
France

7×23 Posts
Default

Quote:
Originally Posted by firejuggler View Post
Ok so :
first flaw :you say the first step is to 'populate' the mask with all the prime number .... but how? since your objective is to determie them?

second : you forgot 3 and 19 in your listed prime

third :it can only work up to 292, after that you may misssome, unless you continue to 'populate' your mask after that

4 : you will remove more ' candidate' if you start with the lowest prime


and I think this method is called the ' wheel'

------------------------
premier probleme: La premiere etape de ta methode consiste a remplir le 'masque' avec TOUT les nombres premier... comment, puisque le but de ton implementation est de les determiner?

second probleme : tu as oublié 3, et 19 dans ta liste de NP

Troisieme probleme : a moi de continuer a nourrir ton 'masque' avec de nouveau nombre, ça ne marchera que jusqu'a 292

Quatrieme chose : Tu retirera plus de candidat si tu commence par le plus petit des nombres premier.


Et je crois que cette methode existe deja, sous le nom de ' roue'


Merci de repondre en français After to try Google traduction

I make the answer in englis mais merci beaucoup

Il n'est pas difficile de faire la liste des nombres premiers: se qui est difficile cc'est de faire une liste avec SEULEMENT les nombres premier

Personeally I use the fact that every prime number is 6k+1
OU 6k-1 So making the liste ot these value you have All the primes

Sample

i:=5
j:=7
repat
Ptime(i):=1;
Prime(j):=1;
I:=I+6
J:=J+6
Until J> Wanted


second probleme : tu as oublié 3, et 19 dans ta liste de NP
true for 19 but 3 is not use:
Using 6 for reason in my list I remove directly 2 and 3 multiple (2*3)


Troisieme probleme : a moi de continuer a nourrir ton 'masque' avec de nouveau nombre, ça ne marchera que jusqu'a 292

No limit for the mask
I use a mask of 223,092,870
you must begin at a multiple of the sizeof the mask

Sample
223092870*10^2000 or more
Just using the mask you eliminate 180,000,000
on the, 223092870 of the mask



Quatrieme chose : Tu retirera plus de candidat si tu commence par le plus petit des nombres premier.

They are not in my list because 6 power


This method is not 'the weel'
The goal of the weel is to fond value primes with a
base (the weel)


a weel 2-19 take n and try to divide n by 2,3,5,7,11,13,17,19
It don't use a mask; The weel is not a tools to make thelist of primes it's a tools to factored...
Wiky don't know weel sieve. Were find more information
The weel is not a sieve!!!!!!

The princip of the weel is not to make a mask and to
make the Prime list:Show us!!!
No trace on the forum. It's speeder tan Erastho?

What I think important is that I bud a set of value smaller then
the complet interval and I cn use a mask not o n the primes but on the composites You take the interval you want and with no code you reduce the
candidats

NO CODE SO NO TIME
NO LIMITS FOR PRIMES 100000 DIGITS I YOU WANT
the mask is universal!!!! you computte it 1 time and you can use it
allyour live

For the twins for example you can reduce the candidat to
900,000 for each set of 223 000 000and ypu have just todee if prime(i)+2 is primes

If we can use PrimeGrid we can compare with other search
JohnFullspeed is offline   Reply With Quote