作者suzzdicon (舒玆迪控)
看板Math
標題[分析] 高微
時間Thu Jun 25 02:57:48 2009
Let F be the set of all fractions.
(a) Find a one-to-one function f : N -> F that does not map N onto F.
(b) Find a one-to-one function g : F -> N that does not map F onto N.
(c) Is the set F countable? Explain your answer.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 163.21.235.230
推 zombiea:1. n-> n/1 , 2. consider F as subset of Z^2 , 06/25 03:14
→ zombiea:then build up an Z^2 to N which is not surj 06/25 03:15
→ zombiea:3. yes , why not , card(F) is at most card(N) by b 06/25 03:16
→ zombiea:also by 1. we have reverse cardinality inquality 06/25 03:16
→ zombiea:thus equal 06/25 03:17