Comment #16 on issue 4122 by [email protected]: Egyptian fractions
http://code.google.com/p/sympy/issues/detail?id=4122
I've finished coding up the other algorithms I mentioned. Turns out the
method using Farey sequences produces results identical to the Golomb
algorithm---the Golomb algorithm is just an improvement on the Farey method
for computational efficiency.
I'm including the Farey algorithm anyway, since SymPy currently doesn't
seem to have a function for computing Farey sequences yet.
Attachments:
egypt2.py 4.0 KB
--
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 [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sympy-issues.
For more options, visit https://groups.google.com/groups/opt_out.
