You are told that n = 1 1 0 1 7 9 is the product of two primes p and q ( p > q ). The number of positive integers less than n that are relatively prime to n (that is those m such that g cd ( m , n ) = 1 ) is 109480. Write the value of p − q .
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 number of positive integers less than n = 110178. Let's assume that p n = y + 1 and q n = z +1. So y = p n - 1 and z = q n - 1. Therefore, p and q have y and z positive multiple respectively less than n. Hence y + z = (The number of positive integers less than n ) - (The number of positive integers less than n that are relatively prime to n ). So y + z = 110178 - 109480 = 698 . Putting the values of y and z ,we get: p n - 1 + q n - 1 = 698 . p n + q n = 700 . p q n ( p + q ) = 700 . So p + q = 700 [ n = pq]. pq = 110179. Calculation gives us p - q = 222
Problem Loading...
Note Loading...
Set Loading...
The number of positive integers less than n that are relatively primes or coprime numbers to n is given by Euler's totient function .
ϕ ( n ) = n k = 1 ∏ m p k p k − 1 where p k is the prime factor of n
⟹ ϕ ( 1 1 0 1 7 9 ) = p q 1 1 0 1 7 9 ( p − 1 ) ( q − 1 ) = 1 1 0 1 7 9 1 1 0 1 7 9 ( p − 1 ) ( q − 1 ) = ( p − 1 ) ( q − 1 )
⟹ ( p − 1 ) ( q − 1 ) p q − p − q + 1 1 1 0 1 7 9 − p − q + 1 ⟹ p + q ( p + q ) 2 p 2 + 2 p q + q 2 p 2 + q 2 ( p − q ) 2 ⟹ p − q = 1 0 9 4 8 0 = 1 0 9 4 8 0 = 1 0 9 4 8 0 = 7 0 0 = 7 0 0 2 = 4 9 0 0 0 0 = 4 9 0 0 0 0 − 2 ( 1 1 0 1 7 9 ) = 2 6 9 6 4 2 = p 2 − 2 p q + q 2 = 2 6 9 6 4 2 − 2 ( 1 1 0 1 7 9 ) = 4 9 2 8 4 = 4 9 2 8 4 = 2 2 2
Note: Since p + q = 7 0 0 and p − q = 2 2 2 , ⟹ p = 4 6 1 and q = 2 3 9 both primes.