Hacker News new | comments | show | ask | jobs | submit login

How base works: In base n, you have a number that looks like a list of digits ex. abc. Let's notate that c = number[0], b = number[1], a = number[2]. Then the value of the number is the sum

  value = 0;
  for(i = 0; i < numberOfDigits; i++)
    value += n^i + number[i];
Or, it looks like a(n^2) + b(n^1) + c*(n^0).

So, if you have a base less than 1, you get smaller as you go to the left.

Also, if you have a negative base, you change from adding to subtracting every digit. In a sort of "That'll take 2 years, minus 4 months, plus 2 weeks, minus 3 days" sort of way.

Applications are open for YC Summer 2018

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact