[PD] robotcowboy spring tour08 info

Howdy all, You may have remembered some information about my tour with my friend Laromlab back in January ... Well, the tour is over and I sat down and put up a full synopsis including music and pictures. You can check it out on my website.

[PD] paths in pd-extended

hi hans, the problem of paths in pd-extended is more than annoying. it is really frustrating. since [declare] is not working (on osx?), [import] causes issues (see my last posting) and help-patches do not include either declare or import anyway, and are write-protected, I really beg you to inclu

Re: [PD] stereo -> 8 channel

there is awesome stuff in the iem externals, you have room simulation guis and extremely cool ambisonic stuff. but I have not used it enough to really can help you with that. you should have a look at all externals that start with iem*** and start from there. (all come with pd-extended, but the

[PD] pdp_colorgrid bug

hi (yves), I tried to look at pdp_colorgrid, but I only get a white background. I tested this with pd-0.40.3 (extended) and mac os x pdp version 0.12.5-darcs and pidip version 0.12.21. anybody else having the same problems? marius ___ PD-list@iem.at mail

[PD] [import] bug

Hi, I am using import pddp/pddplink to import an object. the problem is, that after I imported an external like this, I can only use [pddplink] but not [pddp/pddlink] any more. should I post a bug report, or am I using import in a wrong way??? marius. ___

Re: [PD] lowest common multiple of lots of periods

On 29/03/2008, at 10.22, Andy Farnell wrote: > 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) ?? Maybe using 'lcm(a,b,c) = lcm(lcm(a,b),c)' (which is true sine they share prime factors).

Re: [PD] lowest common multiple of lots of periods

Hmm, sorry I messed up on the gcd so ignore attached it doesn't work On Sat, 29 Mar 2008 09:22:36 + Andy Farnell <[EMAIL PROTECTED]> wrote: > > > 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) ?? > > > > > >

Re: [PD] lowest common multiple of lots of periods

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 <[EMAIL PROTECTED]> wrote: > hi, i need to calculate the lowest common mulitple of > 50 periods ... > i have a

[PD] lowest common multiple of lots of periods

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