Register

Discrete-mathematics

773 views
0 0 votes
Consider the following statements

1) If f is one-to-one function from an infinite set A to itself then f must be onto.

2)  If f is one-to-one function from an finite set A to itself then f must be onto.

3) Power set of countably infinite set is countably infinite.

which of the following is true -

1) I only

2) I and II only

3) All are true.

4) II only

1 Answer

0 0 votes

option 1 -  suppose A has elements  1,2,3 .......now A is mapped one to one to A itself

lets consider mapping 1-1 , 2-2 , 3-3 ...every element has atleast one mapping which means its onto

option 2 - is the same

option 3 - when a set is given....the power set is taken from the given set with various combinations which we know...so if its countably infinite then power set will also be countably infinite

ANS - All are true

Voting & Accepting an answer helps improve the community
← Previous · Doubt in OS: Disk sc...Next → · C programming
← Previous in category · RelationsNext in category → · Inverse of a functio...
Position:
Show:

Related questions

4 4 votes
1 1 answer
375
375 views
GO Classes asked May 16
375 views
GO Classes DPP | GATE CS | Discrete Mathematics| Functions
Let $A$ be the set of all finite binary strings, including the empty string $\epsilon$. Define $F:A\to A$ as follows: $F(w)$ is obtained by writing $0$ before the string ...
1 1 vote
1 1 answer
248
248 views
GO Classes asked May 16
248 views
GO Classes DPP | GATE CS | Discrete Mathematics| Functions
Let $A$ and $B$ be non-empty sets and let $f:A\to B$ be a function. For $S\subseteq A$, define $S^c=A-S$. For $Y\subseteq B$, define $Y^c=B-Y$. Which of the following sta...
2 2 votes
1 1 answer
233
233 views
GO Classes asked May 16
233 views
GO Classes DPP | GATE CS | Discrete Mathematics| Functions
Find the domain of the function $F(x)=\sqrt{\ln(x-1)}+\ln\left(\dfrac{\sqrt{x+1}-2}{x^2-5x+6}\right)$.$[2,\infty)$ $(2,\infty)$ $(2,3)\cup(3,\infty)$ $[2,3)\cup(3,\infty)...
1 1 vote
2 2 answers
214
214 views
GO Classes asked May 16
214 views
GO Classes DPP | GATE CS | Discrete Mathematics| Functions
Let $A=\{1,2,3,4,5,6\}$. Find the number of bijections $f:A\to A$ such that $f(1)\neq1$, $f(2)\neq2$, $f(3)\neq3$, and $f(4)=5$ if and only if $f(5)=4$.