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.
Let F ( x ) = 1 ≤ a , b ≤ 2 0 1 5 ∏ ( x − ω a b ) where $\omega$ is a primitive $2015$th root of unity. We want to find $\log_2\left(-F(-1)\right)$. Then we can write (after checking some symmetry thing) F ( x ) = d ∣ 2 0 1 5 ∏ Φ d ( x ) h ( d ) for some h mapping from the divisors of 2 0 1 5 to Z ≥ 0 . But Φ d ( − 1 ) = 1 unless d = 1 \ 0 for d ∣ 2 0 1 5 , so it suffices to find h ( 1 ) . This is the number of pairs ( a , b ) with 2 0 1 5 ∣ a b , which is easily computed to be ( 2 ⋅ 5 − 1 ) ( 2 ⋅ 1 3 − 1 ) ( 2 ⋅ 3 1 − 1 ) = 1 3 7 2 5 . Thus our answer is lo g 2 ( − ( − 2 ) 1 3 7 2 5 ) = 1 3 7 2 5