Find the smallest positive integer n such that 2 0 1 5 n has the same last three digits as n .
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.
You can also do the following:
2 0 1 5 n ≡ n ( m o d 1 0 0 0 ) ⟺ 1 5 n ≡ n ( m o d 1 0 0 0 ) ⟺ 1 4 n ≡ 0 ( m o d 1 0 0 0 ) ⟺ : 7 2 n ≡ 0 ( m o d 5 3 × 2 3 ) ⟺ : 2 n ≡ 0 ( m o d 5 3 × 2 2 ) ⟺ n ≡ 0 ( m o d 5 0 0 )
The division by 7 is valid since g cd ( 7 , 1 0 0 0 ) = 1 and the division by 2 "reduces" the modulus.
Exactly! (+1)
Problem Loading...
Note Loading...
Set Loading...
We have 2 0 1 5 n ≡ 1 5 n ≡ n ( m o d 1 0 0 0 ) and thus 1 5 n − n = 1 4 n = 1 0 0 0 k for some positive integral k .
The smallest solution is then 1 4 n = 1 0 0 0 k = lcm ( 1 4 , 1 0 0 0 ) or n = 5 0 0 .