# Java int addition - the long way

by NiaSphinx
 Sci Advisor HW Helper P: 4,300 Java int addition - the long way I suppose in base b, one can still obtain the digits at the nth position (starting from n = 0 on the right) of a number N as $$\operatorname{digit}_n(N) = \left[ N / b^n \right] \text{ mod } b$$ where the square brackets denote the floor of the division.