Andrew Lelechenko on Tue, 18 Sep 2012 19:42:04 +0200
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
As for me not looping over all composits, but looping over integers
with a given number of divisors will be of great interest. Of course
there is a dirty implementation like
for(n=1, lim, if(numdiv(n)=..., ...))
or (if a number of divisors is constant while running program) nested
forprime-loops, but native (sieve-based?) implementation would be
great.
--
Best regards,
Andrew
- References:
- forprime
- From: michel.marcus@free.fr
- Re: forprime
- From: Charles Greathouse <charles.greathouse@case.edu>
- Re: forprime
- From: Karim Belabas <Karim.Belabas@math.u-bordeaux1.fr>
- Re: forprime
- From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
- Re: forprime
- From: Karim Belabas <Karim.Belabas@math.u-bordeaux1.fr>
- Re: forprime
- From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
- Re: forprime
- From: Henri.Cohen@math.u-bordeaux1.fr
- Re: forprime
- From: Pascal Molin <molinp@math.jussieu.fr>
- Re: forprime
- From: Charles Greathouse <charles.greathouse@case.edu>
- Re: forprime
- From: Karim Belabas <Karim.Belabas@math.u-bordeaux1.fr>