Comment #19 on issue 4122 by faisal.i...@gmail.com: Egyptian fractions
http://code.google.com/p/sympy/issues/detail?id=4122
Also another thing I have noticed is for rational numbers having large
numerators & denominators , takenouchi gives MemoryError & Graham Jewett
takes a lot of time. I guess this is due to the nature of the algoithhms.
Am I right ? On the other hand, Greedy works very well for any sort of
input. eg, 999999/10000000
But again I see some inconsistency , eg 471/9999999999 works well with
Takenouchi but
9957447673247/31250000000000 (0.318638325543904) gives MemoryError
So do you know what are the limits for Takenouchi & Graham Jewett ? Thanks
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sympy-issues+unsubscr...@googlegroups.com.
To post to this group, send email to sympy-issues@googlegroups.com.
Visit this group at http://groups.google.com/group/sympy-issues.
For more options, visit https://groups.google.com/groups/opt_out.
