Skip to content
Procedure

A multiple made only of 1s: long-divide 111... until nothing is left

Quantitative Aptitude • Number System

Statement

Divide 1, 11, 111, ... by the divisor using long division. At each step, write the remainder, put a 1 after it, and divide again. The first time the remainder is 0, the 1s written so far form the smallest such number, and the quotient is read off the division. This works for divisors that end in 1, 3, 7 or 9.

How to use it

  1. 1Write the dividend as a row of 1s and long-divide, one digit at a time.
  2. 2Stop at the first remainder of 0. The quotient is the number asked for.
  3. 3Check by multiplying the quotient back.

Worked example

What is the smallest number that gives a product of only 1s when multiplied by 13?

Step-by-step

  1. 1
    Remainders after 1, 11, 111, 1111, 11111, 111111 divided by 13: 1, 11, 7, 6, 9, 0.

    Why: Each new remainder is the last one with a 1 put after it, divided by 13: e.g. 71 leaves 6.

  2. 2

    Why: Six 1s is the first that divides exactly.

  3. 3

    Why: Check.

Answer

8547.

Watch out

A divisor that is even or a multiple of 5 never works, since 11...1 is odd and does not end in 0 or 5.

Also known as

repunit, number made of ones, all ones product, 111111 divisible by 7

Appears in past papers

2021