Let be the product of all possible positive integers such that .
Enter the remainder when is divided by 1000.
Notation:
denotes the
greatest common divisor
function.
Bonus : Generalize this for any positive integer replacing 1000.
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.
The natural arithmetic to consider is the multiplicative group of residues modulo n , which we will denote U ( n ) = { a ∈ Z n ∣ g c d ( a , n ) = 1 } . We can then represent U ( n ) as
U ( n ) ≈ U ( 2 a ) × U ( p 1 r 1 ) × U ( p 2 r 2 ) × … × U ( p k r k ) ,
where n = 2 a p 1 r 1 p 2 r 2 ⋅ … ⋅ p k r k for distinct odd primes p i , r i ≥ 1 , and a ≥ 0 ( ≈ stands for isomorphic). Now we notice that the only elements of U ( p i r i ) satisfying b 2 ≡ 1 m o d n are ± 1 . Furthermore, we know U ( 2 a ) ≈ Z 2 × Z 2 a − 2 for a ≥ 2 , so it should have 4 distinct elements satisfying b 2 ≡ 1 m o d 2 a (if a = 0 or 1 , then U ( 2 a ) is just the trivial group).
Therefore, there are 4 ⋅ 2 ⋅ 2 ⋅ … ⋅ 2 = 2 k + 2 residues b satisfying b 2 ≡ 1 m o d n for a ≥ 2 , and 2 k for a = 0 , 1 . Set T = { b ∈ U ( n ) ∣ b 2 ≡ 1 m o d n } . Then notice that
b ∈ U ( n ) ∏ b = b ∈ T ∏ b .
This is because if b ∈ / T , then b = b − 1 , and so the LHS can be rearranged to make b and b − 1 cancel. Furthermore, the RHS can be reduced by considering T = C ∪ D where C = { c ∈ T ∣ c < n / 2 } and D = { d ∈ T ∣ d > n / 2 } . Clearly, for each d ∈ D , d ≡ − c m o d n for some c ∈ C . Thus,
b ∈ T ∏ b = ( − 1 ) ∣ C ∣ c ∈ C ∏ c 2 = ( − 1 ) ∣ C ∣ = ( − 1 ) ∣ T ∣ / 2 = ( − 1 ) 2 k ± 1 = 1
Note: If n = 1 , 2 then the product trivially yields 1