Anders Andersson wrote:

> I have a source here if someone is interested,
> but I'm not very skilled in math, so my implementation
> use the brute force method of testing the modulo of every
> number... Not very fast but it works.. =)

Maybe it would be faster to store all the prime numbers from 0 to 2exp(32) in
a table and truncate to the nearest number ;-)Btw what musical use could have
that feature?


--
Josep M Comajuncosas
C/ Circumval.lacio 75  08790 Gelida - Penedes
Catalunya - SPAIN tel. 93 7792243
e-mail:          gelida@intercom.es
ET Informatica de Sistemes
e-mail: jcomajuncosas@campus.uoc.es
  http://members.tripod.com/csound/