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

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

    return bits.reverse();
  }
Fast Fibonacci Implementation

@param {Number} number to calculate
@return {Number} nth fibonacci number