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
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.
First factorize 6 9 3 = 9 × 7 × 1 1
Let N be such repunit number.So, N is divisible by 9.The number of digits should be 9 k where k ∈ N .Also N is divisible by 1 1 . 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 1 8 k .
N is also divisible by 7 .
1 1 1 ≡ − 1 ( m o d 7 ) and 1 0 0 0 ≡ − 1 ( m o d 7 ) .Then 1 1 1 × 1 0 0 0 = 1 1 1 0 0 0 ≡ 1 ( m o d 7 )
1 1 1 0 0 0 + 1 1 1 = 1 1 1 1 1 1 ≡ 0 ( m o d 7 ) .Here number of digits are 6 .As 1 8 is divisible by 6.
So, smallest number has 1 8 digits which is divisible by 6 9 3