Feynman Long division

Logic Level 4

The above is a long division with most of the digits of any number hidden, except for the three 7's. Given that each of 0, 1, 2, ..., 9 was used at least once for the hidden digits, figure out all of the digits hiding and submit your answer as the value of the dividend (the 6-digit number being divided).

Details and Assumptions:

  • Each X \mathrm X represents a single-digit integer.
  • The leading (leftmost) digit of a number cannot be 0.


The answer is 991750.

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

Mark Hennings
Jul 12, 2017

0 7 8 0 9 1 2 7 \enclose l o n g d i v 9 9 1 7 5 0 8 8 9 0 0 0 1 0 2 7 0 0 1 0 1 6 0 0 1 1 5 0 1 1 4 3 7 \LARGE{ \begin{array}{rll} \phantom{0}\ \mathrm{7} \ \mathrm{8} \ \mathrm{0} \ \mathrm{9} && \\[-1pt] \mathrm{1} \ \mathrm{2} \ \mathrm{7} \ \enclose{longdiv}{ \mathrm{9} \ \mathrm{9} \ \mathrm{1} \ \mathrm{7} \ \mathrm{5} \ \mathrm{0} }\kern-.2ex \\[-1pt] \underline{ \mathrm{8} \ \mathrm{8} \ \mathrm{9} \ \phantom 0 \ \phantom 0 \ \phantom 0 } \\[-1pt] { \mathrm{1} \ \mathrm{0} \ \mathrm{2} \ \mathrm{7} \ \phantom0 \ \phantom0 \ }\kern-.2ex \\[-1pt] \underline{ \mathrm{1} \ \mathrm{0} \ \mathrm{1} \ \mathrm{6} \ \phantom 0 \ \phantom 0 } && \\[-1pt] { \mathrm{1} \ \mathrm{1} \ \mathrm{5} \ \mathrm{0} }\kern-.2ex \\[-1pt] \underline{ \mathrm{1} \ \mathrm{1} \ \mathrm{4} \ \mathrm{3} } && \\[-1pt] \mathrm{7} \end{array} }

Since 7 7 times the divisor, plus a 3 3 -digit number, is still a 3 3 -digit number, the divisor is no greater than 128 128 . The fourth digit of the dividend must be 7 7 . The third digit of the quotient must be 0 0 (since two digits are brought down at the last stage). Since the second and the fourth digits of the quotient multiply the divisor to give a 4 4 -digit number, both the second and the fourth digits of the quotient are each either 8 8 or 9 9 . Thus the quotient is one of 7808 , 7809 , 7908 , 7909 7808,7809,7908,7909 . In the first three cases (since 8 8 times the divisor must be a 4 4 -digit number), the divisor must be at least 125 125 . If the quotient is 7909 7909 , the divisor must be at least 112 112 .

It is now possible to check the possible divisors and quotients and, using the fact that the remainder is 7 7 , retrieve the possible dividends. Only three scenarios give a dividend whose fourth digit is 7 7 , namely 991750 = 127 × 7809 + 7 893724 = 113 × 7909 + 7 980723 = 124 × 7909 + 7 991750 = 127 \times 7809 + 7 \hspace{2cm} 893724 = 113 \times 7909 + 7 \hspace{2cm} 980723 = 124 \times 7909 + 7 The second and third scenarios yield divisions which omit the digit 5 5 (the second omits 6 6 as well). On the other hand, the first scenario is just fine. From this we obtain the answer 991750 \boxed{991750} .

I approached in the same way, but got the first answer 980723, and couldn't figure out why I was wrong. Then read that it must contain all the digits. Later got it . Pretty nice question and a neat solution too. Upvoted!!!

Prayas Rautray - 3 years, 10 months ago

I used code plus guessing and checking until I got the solution

https://goo.gl/7B4Ffa

Kyle T - 3 years, 10 months ago

Log in to reply

I like how you bound these variables. Also, it's interesting to notice that looping over just the quotient and the dividend works, instead of having to brute force through all the possible digits

Agnishom Chattopadhyay - 3 years, 10 months ago

113) 893724 (7909

- 791

   (102)7

-   1017

     (10)24

 -   1017

           7

Here at the 2nd stage division there is a 2 digit number.But here 5 and 6 both missing.And neglect the formatting..

Charlz Charlizard - 3 years, 11 months ago

Log in to reply

Thanks for spotting that.

Mark Hennings - 3 years, 11 months ago

Nice and brilliant solution.

Hana Wehbi - 3 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...