bitSystem = function (n) {
      var bit, bits = [];

      while (n > 0) {
        bit = (n < 2) ? n : n % 2;
        n = Math.floor(n / 2);
        bits.unshift(bit);
      }

      return bits;
    }
Fast Fibonacci Implementation

@param {number} The nth Fibonacci number to calculate
@return {number|undefined} The nth Fibonacci number