The number of positive integers with such that each of the rational expressions
is in lowest terms (i. e. in each expression , the numerator and denominator have no common factors) is:
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.
Find 1 ≤ x ≤ 6 0 , for which
g c d ( 7 x + n − 1 , n ) = 1 ∀ 2 ≤ n ≤ 3 0 1
equivalently
g c d ( 7 x − 1 , n ) = 1 ∀ 2 ≤ n ≤ 3 0 1
If 1 ≤ x ≤ 4 3 , then 6 ≤ 7 x − 1 < 3 0 1 . Therefore, there would definitely be a 2 ≤ n ≤ 3 0 1 such that g c d ( 7 x − 1 , n ) = 1 (just take n = 7 x − 1 ).
If 4 4 ≤ x ≤ 6 0 , then 3 0 7 ≤ 7 x − 1 ≤ 4 1 9 is either a prime or it has a non-trivial factor that is less than or equal to 3 0 1 . If 3 0 7 ≤ 7 x − 1 ≤ 4 1 9 has a factor less that 3 0 1 , then there is a 2 ≤ n ≤ 3 0 1 such that g c d ( 7 x − 1 , n ) = 1 . If 3 0 7 ≤ 7 x − 1 ≤ 4 1 9 is a prime, then g c d ( 7 x − 1 , n ) = 1 ∀ 2 ≤ n ≤ 3 0 1 . Therefore, we need to find all the primes in the interval [ 3 0 7 , 4 1 9 ] , such that they are 6 , modulo 7 .there would be 1 9 primes to check and only 3 of them ( 3 0 7 , 3 4 9 , 4 1 9 ) satisfy the conditions.