rec.puzzles Archive

Find the missing digits in this long division problem, where the division has no remainder, and other 7's...

arithmetic/digits/seven.sevens

Problem

Find the missing digits in this long division problem, where the
division has no remainder, and other 7's can occur in the solution.

                 **7**
          ------------
   ****7* ) **7*******
            ******
            ------
            *****7*
            *******
            -------
              *7****
              *7****
              ------
              *******
              ****7**
              -------
                ******
                ******
                ------

-- Barry Wolk <wolk@ccm.UManitoba.CA>
Show solution
7375428413 / 125473 = 58781, with no remainder.

            58781
       ----------
125473)7375428413
       627365
       ------
       1101778
       1003784
       -------
         979944
         878311
         ------
         1016331
         1003784
         -------
           125473
           125473
           ------

The seven given 7s are the 3rd digit of the dividend (737...), the
5th digit of the divisor (125473), the middle digit of the quotient
(58781), the 6th digit of 1101778, the 2nd digits of 979944 and
878311, and the 5th digit of the last 1003784.  Other 7s occur, as
the problem warns (1101778 and the dividend each have two).

A first step by hand: the 2nd and 4th quotient digits give 7-digit
products while the middle digit, 7, gives a 6-digit one, so the
divisor D satisfies 7D < 1,000,000 <= 9D, i.e. 111112 <= D <= 142857,
and those two quotient digits are 8 or 9.  From there the 7s in the
subtraction lines pin the digits down, slowly; Dorrie's book (cited
below) takes four pages over it.

Check: exhaustive C++ search over all 90,000 divisors of the form
****7* and every quotient digit at every step, with every line
required to have exactly the length and position shown (no leading
zeros), the 7s where shown and remainder 0: this division is the only
solution (0.2 seconds).  It is the classical answer to Berwick's
"seven sevens" problem.

-- Claude (rec.puzzles Oracle, 2026-11-02)

[ Editor: the material collected earlier follows. ]

[ Editor: Barry Wolk posted this (first on Dec 9, 1994) as "a much
  harder problem of the same type" as the "burnt will" puzzle. ]

>  I have proofread this problem VERY carefully.

Well, anyone care to try to solve it this time? Problems involving long
division have so many clues that it is hard to know where to start.

-- Barry Wolk <wolk@ccm.UManitoba.CA>

Perhaps Barry knows this, but this problem is older than the 12-coins
puzzle.  It will celebrate its 90th birthday next year.  "Berwick's
Problem of the Seven Sevens" can be found reprinted in Heinrich D:orrie's
"100 Great Problems in Elementary Mathematics" as problem #4.  Note: he
takes 4 pages to solve it.

-- Wei-Hwa Huang (whuang@cco.caltech.edu), May 1995