[PD] lowest common multiple of lots of periods

[Andy Farnell]

for a pair gcd by Euclid then lcm (a, b) = a/gcd(a, b) * b

Dunno how you can extend this to a list lcm(a, b, c ...z) ??





On Sat, 29 Mar 2008 00:51:00 -0700 (PDT)
punchik punchik <punchikk at yahoo.com> wrote:

> hi,  i need to calculate the lowest common mulitple of
> 50 periods ... 
> i have a patch with 50 syncronic grain generators with
> a time lag between each other...  and i need to
> calculate when the whole  cycle begins again when i
> change parameters dinamically.
> how can i calculate lowest common multiple of a lot of
> numbers in pd? do anybody tried this before... i have
> no idea, maybe theres other software that can do it
> easily, any hint?
> 
> bye
> 
> 
>       ____________________________________________________________________________________
> No Cost - Get a month of Blockbuster Total Access now. Sweet deal for Yahoo! users and friends. 
> http://tc.deals.yahoo.com/tc/blockbuster/text1.com
> 
> _______________________________________________
> PD-list at iem.at mailing list
> UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list


-- 
Use the source
-------------- next part --------------
A non-text attachment was scrubbed...
Name: lcm.pd
Type: application/octet-stream
Size: 1544 bytes
Desc: not available
URL: <http://lists.puredata.info/pipermail/pd-list/attachments/20080329/98264120/attachment.obj>