Prove that the set of positive rational numbers is countable by showing that the function K is a one- to-one correspondence between the set of positive rational numbers and the set of positive integers if where gcd(m,n) = 1 and the prime-power factorizations of m and n are
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.