| Karim Belabas on Tue, 22 Feb 2005 09:51:05 +0100 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: pi(x) |
* Mc Laughlin, James [2005-02-22 06:13]:
> Is the prime-counting function, \pi(x), implemented in pari?
see primepi() [ version 2.2.8 and onward ]
The implementation is currently as naïve as it can get: we go through the
primetable and count [ no checkpointing, so it's not even fast for small
values ]. Also primepi(x) is only defined for x < primelimit.
Cheers,
Karim.
--
Karim Belabas Tel: (+33) (0)1 69 15 57 48
Dep. de Mathematiques, Bat. 425 Fax: (+33) (0)1 69 15 60 19
Universite Paris-Sud http://www.math.u-psud.fr/~belabas/
F-91405 Orsay (France) http://pari.math.u-bordeaux.fr/ [PARI/GP]