The above shows a condense form of a long division between 2 integers, with the last box at the bottom representing the remainder of the quotient. Each box represents a **distinct** single digit non-negative integer.

If 8 digits must be used, what is the largest possible integer that can represent the box at the very bottom?

As an explicit example, the long division below shows that 2 is a possible remainder, but it does not imply that 2 is a maximum possible remainder.

×

Problem Loading...

Note Loading...

Set Loading...