# proof for the general rule of conversion from base 10 to other bases

I just begin reading the book "what is mathematics" by Richard Courant. He states the general rule for passing from the base ten to any other base B is to perform successive divisions of the number z by B; the remainders will be the digits of the number in the system with base B. This is very intuitive and I understand the rule. But How do we prove it? this has raised a very important question: how do we prove intuitive concepts?

Any suggestions?

• Your second question is way too broad. Note that some intuitive concepts are easily proved (like the one which started your question), but others are extremely hard (just think of Russel's Principia Mathematica) or plain wrong (like the Mertens conjecture). – A.P. Apr 20 '13 at 11:15

Suppose you are given a positive integer $x$. It doesn't matter how it is written, as long as you can identify the number (in particular, the original number system doesn't matter). Now, you want to write it as $$x=\sum_{i=0}^{n} b_i B^i$$ where $\{b_i\}$ are the digits of $x$ in the base $B>1$. Observe that if you divide $x=x^{(0)}$ by $B$, by Euclidean division you get $$x^{(0)} = r_0 + Bx^{(1)}$$ for some (positive) integers $x^{(1)}<x^{(0)}$ and $r_0<B$. You can then recursively divide $x^{(1)}$ by $B$ (note that this will require only a finite number of steps), obtaining $$x=r_0+B\left(r_1+B\left(r_2+B\left(\dotso +B(r_n)\right)\right)\right)$$ with $0\leq r_i<B$. Therefore $b_i=r_i$ as required.
• @user5539357 You use division of real numbers, the integer part $\lfloor \cdot \rfloor$ instead of the remainder, and the fractional part $\{\cdot\} = \cdot - \lfloor \cdot \rfloor$ to get the next number to iterate on. Note that with arbitrary real bases $>1$ the resulting sequence of digits is not unique in general, although a canonical one can be found with the construction described here. – A.P. Mar 29 '20 at 11:22