The number of integers with for which the fraction is already in simplest form can be expressed as , where , , , and are (not necessarily) distinct integers from to , inclusive. Find the value of .
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 condition isn't satisfied when g cd ( x 2 + 2 0 1 4 , x 2 + 2 0 1 7 ) = g cd ( 3 , x 2 + 2 0 1 4 ) > 1 , or g cd ( 3 , x 2 + 2 0 1 4 ) = 3 . This means x 2 + 2 0 1 4 ≡ 0 ( m o d 3 ) or x 2 ≡ 2 ( m o d 3 ) , impossible. Therefore the condition is always satisfied for an answer of 4 0 2 9 ⟹ 2 2 .