How many of the statements below are true?
- There exists an integer such that is divisible by 2017.
- There exists an integer such that is divisible by 2017.
- There exists an integer such that is divisible by 2027.
- There exists an integer such that is divisible by 2027.
Note : Both 2017 and 2027 are prime 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.
For this solution, we use the Legendre symbol and its properties.
The problem is equivalent to finding how many of the expressions ( 2 0 1 7 1 0 ) , ( 2 0 1 7 − 1 0 ) , ( 2 0 2 7 1 0 ) , ( 2 0 2 7 − 1 0 ) are equal to 1. First, we calculate
( 2 0 1 7 − 1 ) = ( − 1 ) 2 2 0 1 7 − 1 = ( − 1 ) 1 0 0 8 = 1 ( 2 0 2 7 − 1 ) = ( − 1 ) 2 2 0 2 7 − 1 = ( − 1 ) 1 0 1 3 = − 1 .
From this, we determine that if 10 is a quadratic residue mod 2017, then -10 is too (and vice versa); and if 10 is a quadratic residue mod 2027, then -10 is not (and vice versa).
Now, we calculate ( 2 0 1 7 1 0 ) and ( 2 0 2 7 1 0 ) using the law of quadratic reciprocity and other properties of the Legendre symbol:
( 2 0 1 7 1 0 ) ( 2 0 2 7 1 0 ) = ( 2 0 1 7 2 ) ( 2 0 1 7 5 ) = ( 2 0 1 7 2 ) ( 5 2 0 1 7 ) = ( 2 0 1 7 2 ) ( 5 2 ) = ( − 1 ) 8 2 0 1 7 2 − 1 ⋅ ( − 1 ) 8 5 2 − 1 = 1 ⋅ ( − 1 ) = − 1 . = ( 2 0 2 7 2 ) ( 2 0 2 7 5 ) = ( 2 0 2 7 2 ) ( 5 2 0 2 7 ) = ( 2 0 2 7 2 ) ( 5 2 ) = ( − 1 ) 8 2 0 2 7 2 − 1 ⋅ ( − 1 ) 8 5 2 − 1 = − 1 ⋅ ( − 1 ) = 1 .
Thus, only ( 2 0 2 7 1 0 ) = 1 , and only 1 of the original statements is true.
A simple computer program reveals that 4 8 7 2 − 1 0 = 2 3 7 1 5 9 = 1 1 7 × 2 0 2 7 , among infinitely many other possible values of a .