Repunit

Number Theory Level pending

A repunit is a number consisting only of 1's. What is the minimum number of digits of the repunit that is completely divisible by 693?

Source: The Annual Freshman Math Quiz


The answer is 18.

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

Kushal Bose
Sep 22, 2016

First factorize 693 = 9 × 7 × 11 693=9 \times 7 \times 11

Let N N be such repunit number.So, N N is divisible by 9.The number of digits should be 9 k 9 k where k N k \in N .Also N N is divisible by 11 11 . So, the sum of odd positioned digits will be same as even positioned digits.Therefore, number of digits should even.Then number of digits will be like 18 k 18 k .

N N is also divisible by 7 7 .

111 1 ( m o d 7 ) 111 \equiv -1 \pmod{7} and 1000 1 ( m o d 7 ) 1000 \equiv -1 \pmod{7} .Then 111 × 1000 = 111000 1 ( m o d 7 ) 111 \times 1000=111000 \equiv 1 \pmod{7}

111000 + 111 = 111111 0 ( m o d 7 ) 111000+111=111111 \equiv 0 \pmod{7} .Here number of digits are 6 6 .As 18 18 is divisible by 6.

So, smallest number has 18 \boxed{18} digits which is divisible by 693 693

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...