- #1

Liquid7800

- 76

- 0

Hello,

Just wondering if this is a correct way to say the set of RATIONAL numbers is countable:

Rationals (Q) is countable , because for every Q = p/q , such that p & q are positive INTS (Z)

and since the set of positive INTs (Z) is countable ( a 1:1 correspondence) Q is countable because it is a SUBSET of a countable set.....

it can be listed by listing those Q's with

denominator q = 1 in the first row of a listing matrix

denominator q =2 in the second row and so on...

with p1 = 1 , p2 =2, etc... for each row...

will eventually cover ALL rationals

REMARK:

Ive seen the little N x N matrix and path listing for each rational...but I would like to know...

How would you show this as a mapped 1:1 function?? such that A ---> B showing f(a) = some b??

Thanks for any input...

Just wondering if this is a correct way to say the set of RATIONAL numbers is countable:

Rationals (Q) is countable , because for every Q = p/q , such that p & q are positive INTS (Z)

and since the set of positive INTs (Z) is countable ( a 1:1 correspondence) Q is countable because it is a SUBSET of a countable set.....

it can be listed by listing those Q's with

denominator q = 1 in the first row of a listing matrix

denominator q =2 in the second row and so on...

with p1 = 1 , p2 =2, etc... for each row...

will eventually cover ALL rationals

REMARK:

Ive seen the little N x N matrix and path listing for each rational...but I would like to know...

How would you show this as a mapped 1:1 function?? such that A ---> B showing f(a) = some b??

Thanks for any input...

Last edited: