Let us take two fractions and , where and are pairwise coprime positive integers .
When is simplifiable ? That is, when the numerator and denominator are divisible by the same number? Find the number of all such quadruplets where .
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.
If the a d + c b and b d are both divisible by some integer k , that is k ∣ a d + c b and k ∣ b d , they are both divisible by a prime number p such that p ∣ k . This is because k must be divisible by some prime number p , and if p ∣ k and k ∣ a d + c b and k ∣ b d , then p ∣ a d + c b and p ∣ b d .
Now, if p ∣ b d , then without loss of generality we have p ∣ b . If p ∣ b and p ∣ a d + c b , then p ∣ a d . From this, either p ∣ a or p ∣ d . However, because of the coprimeness of a , b and b , d we have a contradiction, and there are no such quadruplets ( a , b , c , d ) .