A collection of opinions, thoughts, tricks and misc. information.
I looked this up a little earlier today, and wasn't finding anything that would give me a simple farey sequence
with python. Figured I may as well post what I wrote that I'm about to stick up in the python cookbook.
while b: a,b = b,a%b
g = gcd(a,b)
fs = dict()
for i in xrange(1,n+1):
for i2 in xrange(1,i+1):
if i2 < n and i != i2:
r = simplify(i2,i)
fs[float(i2)/i] = r
return [fs[k] for k in sorted(fs.keys())]
It neglects the (0,1) and (1,1) because they're obvious enough and I
end up removing them in my code anyway. Somebody out there can probably
figure out a more efficient and elegant solution, but this is pretty
quick and works just fine.
Take it easy,