Basically my ideas is: N = kb + r N - integer k - divisor r - remainder b - base So N can be written has a multiple of b plus the remainder. Now,

Basically my ideas is: N = kb + r N - integer k - divisor r - remainder b - base So N can be written has a multiple of b plus the remainder. Now, iterate with k. k = k_2b + r_2 And so on, as every number can be written like this. You end up with a polynomial in b N = b^j.r_j + b^(j-1).r_{j-1} + ... + b.r_1 + r_0 Which is represented as a "numeral" by its coefficients (r_j..r_0) One interesting property of this rep, is that for base phi (Golden Ratio ~ 1.618: (1+5^(0.5)/2)) no rep has a "101" subsequence. So basically then integers coded into base-phi get like a multipart/form-data or MIME encoding for free with the "boundary" being, the nonexistant sequence: 101. I really loved to discover this! :) ;p xx ;p