Already completely empty

Logic Level 2

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.

7 6 8 9

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ravi Dwivedi
Jan 1, 2016

Since we are dividing by a single digit integer, our maximum remainder can be 8 8

So let us analyse whether we can achieve remainder of 8 8 or not

Case 1: Remainder of 8 8

We have to divide by 9 9 to achieve a remainder = 8 8

The sequence of numbers 17 , 26 , 35 , 44 , 53 , 62 , 71 , 80 , 89 , 98 17,26,35,44,53,62,71,80,89,98 produces remainder = 8 8 when divided by 9 9

We notice that in this sequence upto 80 80 , if a b \overline{ab} is divided by 9 9 then we need to multiply 9 9 by a a which is a repetition of digit a a and not allowed.

Now 89 89 and 98 98 both contain 8 8 in them and reimainder is also 8 8 but this contradicts that all digits written in long division must be distinct.

So a remainder of 8 is not possible .

Case 2: Remainder of 7 7

First we try to divide by 9 9

The sequence of numbers 16 , 25 , 34 , 43 , 52 , 61 , 70 , 79 , 88 , 97 16,25,34,43,52,61,70,79,88,97 produces a remainder of 7 7 on division by 9 9

We remove 70 , 79 , 88 , 97 70,79,88,97 from our list as 7 7 cannot both be in the number and the remainder and in 88 88 we have already 8 8 repeated two times.

Upto 61 61 by the same previous logic we need to multiply 9 9 by the first digit of that number, example, 61 = 9 × 6 + 7 61=9 \times 6+7 Here 6 6 is repreated and hence is not accordance with the rules

Now we check that can we get remainder of 7 7 when we divide by 8 8

Here the required sequence is 15 , 23 , 31 , 39 , 47 , 55 , 63 , 71 , 79 , 87 , 95 15,23,31,39,47,55,63,71,79,87,95

we remove 47 , 71 , 79 , 87 47,71,79,87 because they contain 7 7 and remainder is also 7 7 .This repeats 7 7 and is not allowed. 55 55 is also removed as it has 5 5 two times.

8 × 7 + 7 = 63 8 \times 7+7=63 is also removed because we divide by 7 7 and remainder is also 7 7 which is not allowed.

We are left with 15 , 23 , 31 , 39 , 95 15,23,31,39,95

Now for 15 , 23 , 31 15,23,31 we need to multiply 8 8 by their first digits which forces a repetition of 1 , 2 , 3 1,2,3 respectively. For 39 = 8 × 4 + 7 = 32 + 7 39=8 \times 4+7= 32+7 in which 3 3 is repeated. In case of 95 95 we need 8 8 to multiply by 11 11 so that 1 1 is repeated.

In this case also we cannot get a remainder of 7 7

Conclusion: Remainder of 7 7 is also not possible to achieve

Case 3: Remainder of 6

Remainder of 6 is achieved in this way

90 = 7 × 12 + 6 = 84 + 6 90=7 \times 12 +6 = 84+6

So the answer is 6 \boxed{6} since we checked that no one of the greater remainders are possible.

NOTE: If I can write long division box like @Pi Han Goh then my solution will be better but I don'tknow how to write. Can anybody suggest how to make this long division box and write numbers in it.

Moderator note:

Great analysis of the different cases of possible remainders.

Haha, they are all in picture form. I just draw some squares and straight lines in Microsoft Paint.

thanks for your solution!!! =D

Pi Han Goh - 5 years, 5 months ago

You might want to check out some LaTeXed Long division in the wiki: Fill in the Blanks .

Pi Han Goh - 5 years, 5 months ago

12 7 \enclose l o n g d i v 90 84 6 \begin{array}{rll} 12 \\[-3pt] 7 \enclose{longdiv}{90}\kern-.2ex \\[-3pt] \underline{84} \\[-3pt] 6\ \\[-3pt] \end{array}

John Wyatt - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...