We define a unitary divisor of to be a divisor such that . Let be the sum of all unitary divisors of . Determine the remainder when is divided by 1000.
Notation : denotes the greatest common divisor function.
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.
Since 2 0 1 6 = 2 5 × 3 2 × 7 , we have 2 0 1 6 2 0 1 6 = 2 1 0 0 8 0 × 3 4 0 3 2 × 7 2 0 1 6 . Thus the unitary divisors are 1 , 2 1 0 0 8 0 , 3 4 0 3 2 , 7 2 0 1 6 , 2 1 0 0 8 0 × 3 4 0 3 2 , 2 1 0 0 8 0 × 7 2 0 1 6 , 3 4 0 3 2 × 7 2 0 1 6 , 2 1 0 0 8 0 × 3 4 0 3 2 × 7 2 0 1 6 and hence S = ( 1 + 2 1 0 0 8 0 ) ( 1 + 3 4 0 3 2 ) ( 1 + 7 2 0 1 6 ) We have 2 3 ≡ 0 ( m o d 8 ) and 3 2 ≡ 7 2 ≡ 1 ( m o d 8 ) , so that 2 1 0 0 8 0 ≡ 0 ( m o d 8 ) and 3 4 0 3 2 ≡ 7 2 0 1 6 ≡ 1 ( m o d 8 ) . Since 2 1 0 0 ≡ 3 1 0 0 ≡ 7 2 0 ≡ 1 ( m o d 1 2 5 ) , we deduce that 2 1 0 0 8 0 ≡ 2 8 0 ≡ 5 1 3 4 0 3 2 ≡ 3 3 2 ≡ 9 1 7 2 0 1 6 ≡ 7 1 6 ≡ 1 0 1 ( m o d 1 2 5 ) By the Chinese Remainder Theorem, 2 1 0 0 8 0 ≡ 1 7 6 3 4 0 3 2 ≡ 8 4 1 7 2 0 1 6 ≡ 6 0 1 ( m o d 1 0 0 0 ) and hence S ≡ 1 7 7 × 8 4 2 × 6 0 2 ≡ 4 6 8 ( m o d 1 0 0 0 )