working on some math stuff. in it i made use of a couple of reasonable assumptions, mainly:
for every integer k there is a fibonacci number that is a multiple of k.
for all integers a,b>0, if a and b are
relatively prime, then there's an integer m>0 such that a^m = 1 (mod b).
first seems reasonable, right? I'm having the devil of a time proving it
(
Read more... )