Find the smallest positive integer , such that the fractions
are all in lowest terms.
Details and assumptions
The fraction is in lowest terms if and are coprime.
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 k from 1 to 3 0 1 , we must have g cd ( k , N + k + 2 0 ) = 1 . This is equivalent to g cd ( k , N + 2 0 ) = 1 .
Clearly, the values of N from 1 to 2 8 1 will not work. Neither will any of the numbers N = 2 8 2 to 2 8 6 , since n + 2 0 will be composite, hence have a smaller factor. However, for N = 2 8 7 , we have N + 2 0 = 3 0 7 . It is a prime, so g cd ( k , N + 2 0 ) = 1 for all k < 3 0 7 . Thus, the smallest positive integer is 287.