What is the smallest positive integer for which ?
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.
First divide out the common factor: gcd ( n , 6 3 0 0 0 ) = 4 2 if and only if gcd ( 4 2 n , 1 5 0 0 ) = 1 . So let n = 4 2 m , with m the 2015th positive integer that is coprime to 1500.
Second, we must find values of m that have no factors in common with 1 5 0 0 = 2 2 ⋅ 3 ⋅ 5 3 . This means that m is not a multiple of 2, 3, or 5; in other words, gcd ( m , 3 0 ) = 1 .
Third, since gcd ( m + 3 0 k , 3 0 ) = gcd ( m , 3 0 ) , the gcd values repeat themselves with period 30. Therefore we only need to find the values 0 ≤ m < 3 0 for which gcd ( m , 3 0 ) = 1 . These are easily found: 1 , 7 , 1 1 , 1 3 , 1 7 , 1 9 , 2 3 , 2 9 . (There are only eight, since ϕ ( 3 0 ) = ( 2 − 1 ) ( 3 − 1 ) ( 5 − 1 ) = 8 . We also save work by noticing that the sequence is its own mirror image around 30/2 = 15.)
Thus for every 30 values of m there are 8 that satisfy the condition gcd ( m , 3 0 ) = 1 . We need the 2015th value of m ; this means that we skip ⌊ 8 2 0 1 5 ⌋ = 2 5 1 groups of 30, then take the 7th acceptable number after that (see the list above):
m = 2 5 1 ⋅ 3 0 + 2 3 = 7 5 5 3 .
Finally, n = 4 2 m = 3 1 7 2 2 6 .