> > If we had a "Fibonacci inverse", we could use it to discover the minimum > number of iterations required to generate N bits, then use that as an > argument to zUr9 , and take the first N bits from its result. > The relation is:
zUr _1+fib 4 1 0 1 1 0 zUr _1+fib 7 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 #.zUr _1+fib 4 22 #.zUr _1+fib 7 1488565 =@@i ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
