We will call a positive integer N warped if there exists a multiple of N whose digits are all the same. Find the sum of the first 10 non-warped numbers
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.
Really nice proof with Euler's theorem; I feel that the crux of the proof is the change of perspective from trying to construct a warped or a non-warped number to trying to construct the multiple. Also, not that this could be solved without Euler's formula - for those who don't know it - by just proving the following specific lemma:
Lemma: Let r be an integer with g c d ( r , 1 0 ) = 1 . Then there exists an a such that r ∣ 1 0 a − 1
Proof: since g c d ( 1 0 , r ) = 1 we can find two integers x , y , x > y , such that
1 0 x = 1 0 y (mod r ) ⇒ 1 0 y ( 1 0 x − y − 1 ) = 0 (mod r )
Since we know g c d ( 1 0 , r ) = 1 we must have r ∣ 1 0 x − y − 1
And then you just progress as you did :)
Nice. But the numbers are wARped, not wRAped. ;)
but 10 * 101 = 1010 where the digits of original number are only used and according to me there can't exist a warped number if you are just talking about the original digits of number being used to form its multiple
Did the same but 0 is a multiple of every number.
These are some of the points that I have observed.
All 1-digit numbers are warped numbers.
All positive integers ending with 0 are non-warped numbers
All prime numbers (except 2) and their multiples upto 9 are warped numbers.
All numbers of the form 5 n − 2 and 2 n (where n > 3 ) and their multiples are non-warped numbers.
Based on these,the first 10 non-warped numbers are: 1 0 , 1 6 , 2 0 , 2 5 , 3 0 , 3 2 , 4 0 , 4 8 , 5 0 , 6 0
Therefore,sum= 331
Very nice: can you then prove the following culmination of your observations? All non-warped numbers are of the form 1 0 k , 1 6 k or 2 5 k for an integer k
Problem Loading...
Note Loading...
Set Loading...
Note that all numbers with the same digits can be expressed as a ( 9 1 0 n − 1 ) , where 1 ≤ a ≤ 9 . Hence N is a wraped number ⟺ there exists a , n such that N ∣ a ( 9 1 0 n − 1 ) .
Lemma: If g c f ( N , 1 0 ) = 1 , then there exists n such that N ∣ 9 1 0 n − 1
Proof: In mod notation: 9 1 0 n − 1 ≡ 0 ( m o d N )
⇒ 1 0 n ≡ 1 ( m o d 9 N ) , since g c f ( 9 N , 1 0 ) = 1 , hence by Euler's theorem n = ϕ ( N ) satisfy our condition.
Let k denote a number such that g c f ( k , 1 0 ) = 1 . By this lemma, numbers that can be expressed as 2 e 1 k , 5 e 2 k where 0 ≤ e 1 ≤ 3 , 0 ≤ e 2 ≤ 1 (don't forget a ) are wraped numbers. On the other hand, numbers that are divisible by any of 1 0 , 1 6 , 2 5 are not wraped numbers. Listing these numbers in increasing order gives:
1 0 + 1 6 + 2 0 + 2 5 + 3 0 + 3 2 + 4 0 + 4 8 + 5 0 + 6 0 = 3 3 1 .