1. Let \(F\) be the set of all functions from \([0,1]\) to \([0,1]\) itself. If \(\operatorname{card}(F) = f\) then

Explanation for Question 1:
Let \(S = \{f \ | \ f:A \rightarrow B\} =\) The set of all functions from \(A\) to \(B\). Then \(|S| = |B|^{|A|}\). In this case, we have \(c^c = 2^c > c\). This completes the explanation for Question 1.

2. If \(f: A \rightarrow B\) is a one-to-one map and \(A\) is countable, then which is correct?

Explanation for Question 2:
If \(A\) is countable, it implies that \(f(A) \subset B\) is countable. This completes the explanation for Question 2.

3. Let \(A\) be an infinite set of disjoint open subintervals of \((0,1)\). Let \(B\) be the power set of \(A\). Then

Explanation for Question 3:
From every element of \(A\), which is an open interval, we can select a unique rational representative since all subintervals are disjoint and non-trivial. Thus, \(|A| \leq |\mathbb{Q}|\), hence \(A\) is countable. Also, \(A\) is infinite implies that \(|A| = \aleph_0\). Then \(|P(A)| = 2^{\aleph_0} = c\). This completes the explanation for Question 3.

4. Match the following List-I with List-II and choose the correct:

List-I

A. Countable

B. Uncountable

C. Empty set

List-II

1. Set of transcendental elements in \(\mathbb{R}\)

2. Set of all functions from \(\mathbb{Z}_2 = \{0,1\}\) to \(\mathbb{N}\)

3. \(\{n \in \mathbb{N}: \sqrt{n+1}-\sqrt{n}\) is rational\(\}\)

Explanation for Question 4:
1. The set of all algebraic numbers is countable in \(\mathbb{R}\), thus the set of transcendental numbers is a complement of a countable set in \(\mathbb{R}\), hence uncountable. 2. Set of all functions has cardinality \(\aleph_0^2 = \aleph_0\) in this case, hence countable. 3. Any two consecutive natural numbers can’t be perfect squares, thus the set is empty. This completes the explanation for Question 4.

5. Let \(A\) be the set of lines passing through the origin and having a slope that is an integral multiple of \(\frac{\pi}{12}\). Then

Explanation for Question 5:
For every integer, we have a line. Thus, there are countably infinite such lines. This completes the explanation for Question 5.

6. Consider the following statements:

1. The set of all finite subsets of the natural numbers is countable

2. The set of all polynomials with integer coefficients is countable

Choose the correct answer:

Explanation for Question 6:
1. True statement. 2. For any infinite set \(A\), \(|A \times A| = |A|\). This completes the explanation for Question 6.

7. Let \(A\) and \(B\) be infinite sets. Let \(f\) be a map from \(A\) to \(B\) such that the collection of pre-images of any non-empty subset of \(B\) is non-empty. Which of the following statements is incorrect?

Explanation for Question 7:
As the pre-image of every non-empty set is non-empty, we can use singleton sets in \(B\) to show that every element in \(B\) has an inverse image, thus \(f\) is an onto map. Implies that \(|A| \geq |B|\). Therefore, a, b, and d are true statements. This completes the explanation for Question 7.

8. If \(f\) is a function with domain \(A\) and range \(B\), then which of the following is correct?

Explanation for Question 8:
Note that for any set \(A\), \(|f(A)| = |B| \leq |A|\). This completes the explanation for Question 8.

9. Which of the following statements is correct?

Explanation for Question 9:
For a, since \(\mathbb{Q}\) is countable, thus every subset of \(\mathbb{Q}\) is countable. As a non-trivial interval is uncountable, it is a union of countable rationals and uncountable irrationals. Thus b is false. For c, we can consider an empty set for any set to be a countable set. This completes the explanation for Question 9.

10. Select the correct statement:

1. \(\phi \neq S\) is a countable set

2. There exists a surjection from \(\mathbb{N}\) onto \(S\)

3. There exists an injection from \(S\) into \(\mathbb{N}\)

Explanation for Question 10:
There exists a surjection from \(\mathbb{N}\) to \(S\) implies that \(|\mathbb{N}| \geq |S|\). If there exists an injection (1-1) map from \(S\) to \(\mathbb{N}\), it implies that \(|S| \leq |\mathbb{N}|\). Both imply that \(S\) is countable and thus are equivalent. This completes the explanation for Question 10.