Let p and q be distinct primes.
Then find the number of pairs of positive integer solutions ( x , y ) of the equation x 1 + y 1 = p q 1 .
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 above equation can be rewritten as:
x 1 + y 1 = p q 1 ⇒ x y x + y = p q 1 ⇒ y = p q + x − p q p 2 q 2 .
If p , q are distinct primes, then p 2 q 2 has nine positive integer divisors. Hence there are nine ordered-pairs ( x , y ) with x , y ∈ N .
If instead of 1/pq, we have a prime number p then, it means y = p + p^2/(x-p) So that implies we have 2 + 3 = 5 solutions ? Or is it only 3 solutions ?
Log in to reply
In positive integer divisors, it's only 3, Vijay. Any natural number that is expressible as p^n (p is a prime) contains just n+1 divisors (by the Fundamental Formula of Arithmetic). In my original answer p^2q^2 has (2+1)*(2+1) = 9 divisors, which takes into account each prime factor and its associated exponent. Try out the example 36 = 2^2 * 3^2!
Problem Loading...
Note Loading...
Set Loading...
There's also the standard way of converting equalities like these into diophantine equations. Multiplying each side by x y p q , we get,
y p q + x p q = x y
x y − x p q − y p q + ( p q ) 2 = p 2 q 2
( x − p q ) ( y − p q ) = p 2 q 2
We see that x − p q and y − p q can be whatever positive integer factor we want, so we just want to find the number of ways to factor p 2 q 2 into a product of two integers. We get ( 2 + 1 ) ( 2 + 1 ) = 9 .