Since the Fibonacci numbers grow exponentially (powers of phi, -:1+%:5), the representation is logarithmic and therefore efficient. (For example, "Arabic notation" is logarithmic. Roman numerals are not.)
On Thu, Jul 18, 2019 at 9:49 PM Devon McCormick <[email protected]> wrote: > So you're decomposing a given number into a unique(?) sum of F=.Fibonaccis > represented by a Boolean with a 1 for each F? That is, the Boolean does > not waste space by representing non-F numbers: the positions 0 1 2 3 4.. > represent 1 2 3 5 8...? > > It looks potentially efficient if you have very large numbers to represent. > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
