|Bill Allombert on Thu, 01 Mar 2018 20:41:24 +0100|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: forprime in arithmetic progressions?|
On Wed, Feb 28, 2018 at 10:39:55PM -0400, Remy José Cano wrote: > At purpose of forprime and its internal iterator(s): > > By giving a review to http://oeis.org/A005117, and the usage of > forprime made there. > > While roughly coding for: > https://oeis.org/w/images/1/13/RJCano_AlwaysSquarefree_problem_motivation_.txt > > I asked that time for N>0, why not? to offer the possibility of > "browsing" through those primes pre-computed by PARI like if we were > performing a binary search ranging from 2 and the next prime close to > sqrt(N). Maybe you can be interested by the new 'forsquarefree' function in PARI 2.10. Cheers, Bill.