Le 2011-12-18 à 12:51:00, Alexandre Torres Porres a écrit :
I will take care of that after february, when I finish up my thesis. Can
I count on you to help me revise it?
Sorry, I meant to say : « Yes ».
__
| Mathieu
I will take care of that after february, when I finish up my thesis. Can I
count on you to help me revise it?
thanks
alex
2011/12/18 Mathieu Bouchard ma...@artengine.ca
Le 2011-12-18 à 02:42:00, Alexandre Torres Porres a écrit :
by the way, you guys rock :-)
So, btw, where can people
for pi. :-)
.mmb
On Fri, Dec 16, 2011 at 2:46 PM, Jonathan Wilkes jancs...@yahoo.com wrote:
From: i go bananas hard@gmail.com
To: Ludwig Maes ludwig.m...@gmail.com
Cc: pd-list@iem.at
Sent: Friday, December 16, 2011 1:16 PM
Subject: Re: [PD] number to fractions
Le 2011-12-16 à 00:52:00, Alexandre Torres Porres a écrit :
Is there an external that converts decimal numbers to fractions, like
1.5 = 3 / 2 ? I bet it's complicated to do it as a vanilla patch,
right?
Take the number, subtract its whole part to get something less than 1,
then invert it to
Le 2011-12-17 à 03:44:00, i go bananas a écrit :
how do you get from a continued fraction in the form like this:
[0;1,5,2,2]
to a fraction in the form like this:
27/32
this patch gets as far as that [0; 1,5,2,2] form. but i'm still not sure how
to get further
keep track of the last two
when I change the maximum denominator value results are weird and Pd
freezes.
cheers
2011/12/17 Mike Moser-Booth mmoserbo...@gmail.com
I just added it to my library on GitHub:
https://github.com/dotmmb/mmb
But, yeah, feel free to use it however you want.
.mmb
On Sat, Dec 17, 2011 at
Oops, the right inlet was connected to a [sel] when it should have
been connected to [ 1000]. I'll upload the fix here and on GitHub.
.mmb
On Sat, Dec 17, 2011 at 7:57 PM, Alexandre Torres Porres
por...@gmail.com wrote:
when I change the maximum denominator value results are weird and Pd
i kinda figured that
2011/12/17 Mike Moser-Booth mmoserbo...@gmail.com
Oops, the right inlet was connected to a [sel] when it should have
been connected to [ 1000]. I'll upload the fix here and on GitHub.
.mmb
On Sat, Dec 17, 2011 at 7:57 PM, Alexandre Torres Porres
por...@gmail.com
thanks mattieu!
i got it working, thanks to your great help!
you have no idea how bummed out i was that i couldn't make this work the
other day.
dec-to-frac-help.pd
Description: Binary data
dec-to-frac.pd
Description: Binary data
___
Pd-list@iem.at
cool, but now we have two patches that behave and work the same way?
thanks
Alex
2011/12/18 i go bananas hard@gmail.com
thanks mattieu!
i got it working, thanks to your great help!
you have no idea how bummed out i was that i couldn't make this work the
other day.
I mean one from bananas and another from mike, i guess it was clear
2011/12/18 Alexandre Torres Porres por...@gmail.com
cool, but now we have two patches that behave and work the same way?
thanks
Alex
2011/12/18 i go bananas hard@gmail.com
thanks mattieu!
i got it working, thanks
by the way, you guys rock :-)
2011/12/18 Alexandre Torres Porres por...@gmail.com
I mean one from bananas and another from mike, i guess it was clear
2011/12/18 Alexandre Torres Porres por...@gmail.com
cool, but now we have two patches that behave and work the same way?
thanks
Alex
Le 2011-12-16 à 15:51:00, i go bananas a écrit :
(using the 'division method' like this:
http://easycalculation.com/what-is-hcf.php )
The division method is much more known as Euclid's Algorithm...
And I never saw it named HCF before. Always PGCD in French and GCD in
English.
By the
Le 2011-12-18 à 02:42:00, Alexandre Torres Porres a écrit :
by the way, you guys rock :-)
So, btw, where can people download the psprofile externals ?
__
| Mathieu BOUCHARD - téléphone : +1.514.383.3801 - Montréal,
On 16/12/11 06:51, i go bananas wrote:
by the way, here is the method i used:
first, convert the decimal part to a fraction in the form of n/10
next, find the highest common factor of n and 10
(using the 'division method' like this:
http://easycalculation.com/what-is-hcf.php )
then
yeah, my patch only works for rational numbers.
will have a look at the article / method you posted, claude.
On Fri, Dec 16, 2011 at 7:49 PM, Claude Heiland-Allen cla...@goto10.orgwrote:
On 16/12/11 06:51, i go bananas wrote:
by the way, here is the method i used:
first, convert the
sorry, should have said 'finite' numbers.
___
Pd-list@iem.at mailing list
UNSUBSCRIBE and account-management -
http://lists.puredata.info/listinfo/pd-list
i had a go at it
thanks, I kinda had to go too, but no time... :(
yeah, my patch only works for rational numbers.
you know what, I think I asked this before on this list,
deja'vu
will have a look at the article / method you posted, claude.
are you going at it too? :)
by the way, I meant
actually, i'm not going to do anything more on this.
i had a look at the articles claude posted, and they went a bit far over my
head.
my patch will still work for basic things like 1/4 and 7/8, but i wouldn't
depend on it working for a serious application. As you first suggested,
it's not so
looks like a job for an external
2011/12/16 i go bananas hard@gmail.com
actually, i'm not going to do anything more on this.
i had a look at the articles claude posted, and they went a bit far over
my head.
my patch will still work for basic things like 1/4 and 7/8, but i wouldn't
it's possible in vanilla, but the mathematics goes over my head
On Sat, Dec 17, 2011 at 1:05 AM, Alexandre Torres Porres
por...@gmail.comwrote:
looks like a job for an external
2011/12/16 i go bananas hard@gmail.com
actually, i'm not going to do anything more on this.
i had a look
On 16/12/11 16:05, Alexandre Torres Porres wrote:
looks like a job for an external
Not really answering the OP question but something could be done in Python:
def find_frac(num):
f = float(num)
last_error = 1000
best = (0,0)
for i in xrange(1,1001):
for j in
If you guys 'd done your math, you'd know there is an ancient algorithm for
approximating numbers by fractions and its called continued fractions.
On 16 December 2011 18:38, Lorenzo Sutton lorenzofsut...@gmail.com wrote:
On 16/12/11 16:05, Alexandre Torres Porres wrote:
looks like a job for
if you had read the thread, you would have seen that claude posted a link
to that technique.
now go and make a PD patch that does it, mr smart guy.
On Sat, Dec 17, 2011 at 3:00 AM, Ludwig Maes ludwig.m...@gmail.com wrote:
If you guys 'd done your math, you'd know there is an ancient
how do you get from a continued fraction in the form like this:
[0;1,5,2,2]
to a fraction in the form like this:
27/32
this patch gets as far as that [0; 1,5,2,2] form. but i'm still not sure
how to get further
continued.pd
Description: Binary data
online calculator
http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/cfCALC.html
___
Pd-list@iem.at mailing list
UNSUBSCRIBE and account-management -
http://lists.puredata.info/listinfo/pd-list
yes, but it's difficult to embed that in a pd patch, yeah?
On Sat, Dec 17, 2011 at 4:05 AM, Alexandre Torres Porres
por...@gmail.comwrote:
online calculator
http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/cfCALC.html
___
Pd-list@iem.at
From: i go bananas hard@gmail.com
To: Ludwig Maes ludwig.m...@gmail.com
Cc: pd-list@iem.at
Sent: Friday, December 16, 2011 1:16 PM
Subject: Re: [PD] number to fractions external?
if you had read the thread, you would have seen that claude posted a link
...@gmail.com
Cc: pd-list@iem.at
Sent: Friday, December 16, 2011 1:16 PM
Subject: Re: [PD] number to fractions external?
if you had read the thread, you would have seen that claude posted a link to
that technique.
now go and make a PD patch that does it, mr smart guy.
Wow, how much cpu does
hi there,
Is there an external that converts decimal numbers to fractions, like 1.5
= 3 / 2 ?
I bet it's complicated to do it as a vanilla patch, right?
thanks
alex
___
Pd-list@iem.at mailing list
UNSUBSCRIBE and account-management -
i had a go at it. This one converts up to 5 decimal places (you could
probably mod it to do more, but then you get pretty close to the limits of
float-based arithmetic, i think).
i was getting glitches, because of the known issue where 58/1000 comes out
as 57.9.. , so i have just added a
by the way, here is the method i used:
first, convert the decimal part to a fraction in the form of n/10
next, find the highest common factor of n and 10
(using the 'division method' like this:
http://easycalculation.com/what-is-hcf.php )
then just divide n and 10 by that factor.
32 matches
Mail list logo
