![]() |
![]() |
#1 |
May 2011
France
A116 Posts |
![]()
I'm looking to the algorithm to compute the number of PTIMES(not divisors)
sample how many ptimes less 10^10? Thanks John |
![]() |
![]() |
![]() |
#2 |
"Richard B. Woods"
Aug 2002
Wisconsin USA
170148 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
May 2011
France
2418 Posts |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#4 |
Jan 2008
France
2×271 Posts |
![]()
Tomas Oliveira e Silva has a nice article describing his implementation of Meissel-Lehmer-Lagarias-Miller-Oldyzko-Deléglise-Rivat combinatorial method.
|
![]() |
![]() |
![]() |
#5 |
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
![]() |
![]() |
![]() |
![]() |
#6 |
May 2011
France
7×23 Posts |
![]()
Just after you have doubled
![]() |
![]() |
![]() |
![]() |
#7 |
May 2011
France
7×23 Posts |
![]()
Merci de ce lien .
J'ai mis au point une méthode et je suis fier de voir quelle ressemble beaucoup à celle de Legendre! C'est pareil pour la factorisation ;je suis tout aussi fier d'avoir vu que c'était la même que Fermat Moi je sais que je n'ai pas copié: c'est une belle revanche sur la maladie C'est pareil pour la division:personne ne me croit mais je suis sur d'aller plus vite que les méthodes connues: aucune multiplication (de chiifres et de nombre) Un jour peut être un matheux se penchera dessus. En attendant une petite question pour s'occuper SI vous divisez un nombre n par deux, vous obtenez deux ensembles de n/2 éléments.. Existe-t-il une même règle mais pour les nombres premiers il y a 25 NP< 100 mais pas 50 <200 Pas facile: même de notre Belle Province (je n'ai pas la solution mais j'en ai vu un qui dormait) John |
![]() |
![]() |
![]() |
#8 |
Apr 2010
Over the rainbow
22·17·37 Posts |
![]()
*translator hat*
Thanks for the link. I made a methode myself, and i'm pround that it look like Legendre's a lot. It is the same thing for factorisation :I'm also pround to find that it is the same as Fermat's. Iknow I didn't copy them : it's a nice comeback from disease. It's the same for the divisions : nobody believe me but i'm sure to go faster than the know method : no multiplication ( digit or number s). Maybe someday a math wizard will take a look at it. While waiting on that, another question If you divine a number N by 2, you obtain 2 set of 2/n element.. Does such a rule exist for prime numbers? there is 25 prime <100, but not 50 under 200 Not easy; even from the belle province ( Quebec, french talking part of Canada) (I do not have the solution, but i've seen one around ) (sorry can't translate that one accuratly. It make no sense as such in french , so I translated as I think he did mean) |
![]() |
![]() |
![]() |
#9 |
Apr 2010
Over the rainbow
22×17×37 Posts |
![]()
replace the unclever 'disease' by illness...
Et pis, john, non, je ne maitrise pas le français , je parle bien l'anglais ;p. Je suis de la 'moche' province...je suis français. (and, John i do not master french , I handle english ;p. I'm from the 'ugly' province... i'm french) |
![]() |
![]() |
![]() |
#10 |
May 2011
France
7·23 Posts |
![]()
Cela devient difficile: des Francais qui ne perlent pas Francais ,mais qui le traduise benet qui habite au Canada Anglais
On dirait du Corneiie ![]() John |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! | dabaichi | News | 571 | 2020-10-26 11:02 |
disk died, prime work lost forever? where to put prime? on SSD or HDD? | emily | PrimeNet | 3 | 2013-03-01 05:49 |
Prime Cullen Prime, Rest in Peace | hhh | Prime Cullen Prime | 4 | 2007-09-21 16:34 |
How do I determine the xth-highest prime on prime pages? | jasong | Data | 7 | 2005-09-13 20:41 |
The 40th known Mersenne prime, 220996011-1 is not PRIME! | illman-q | Miscellaneous Math | 33 | 2004-09-19 05:02 |