Topics

Let A and B be any two sets. If there exists a 1-1 correspondence between the sets A and B, then A and B are called ___.


A) countable

B) equivalent

C) finite

D) none of these

Correct Answer:
B) equivalent

Description for Correct answer:
If A = {1,2,3,...} and

B = {2,4,6,...} then

\(\exists\) a mapping \(f:A\rightarrow B\)

definde by \(f(x)=2x\ \forall\ x\in A\)

which is clearly one-one and onto.

Part of solved Real Analysis questions and answers : >> Elementary Mathematics >> Real Analysis




Comments
No comments available




Similar Questions
1). If A and B are equivalent and B and C equivalent then
A). A and C are not equivalent
B). A and C are equivalent
C). B and A are not equivalent
D). None of these
-- View Answer
2). A set which is not finite is called ____.
A). an infinite set
B). denumerable set
C). countable set
D). none of these
-- View Answer
3). The set A is said to be ____ if A is equivalent to the set I of positive integers.
A). countable
B). uncountable
C). denumerable
D). none of these
-- View Answer
4). A set is said to be ____ if it is equivalent to N, the set of natural numbers.
A). Denumerable
B). Countable
C). Uncountable
D). none of these
-- View Answer
5). A set which is not be ____.
A). denumerable set
B). enumerable set
C). uncountable set
D). none of these
-- View Answer


6). The set of all rational numbers is x such that \(0\le x \le 1\) is ______.
A). countable
B). uncountable
C). finite
D). none of these
-- View Answer
7). The set of all polynomial functions integer coefficients is ____.
A). denumerable
B). countable
C). uncountable
D). none of these
-- View Answer
8). The set of all positive rational numbers is _____.
A). countable
B). uncountable
C). finite
D). none of these
-- View Answer
9). The set of all polynomial functions with integer coefficients is _____.
A). denumerable
B). countable
C). uncountable
D). none of these
-- View Answer
10). The intervals (0,1) and [0,1] are _____.
A). similar
B). equivalent
C). countable
D). none of these
-- View Answer
Home About Us Terms and Conditions Privacy Policy Contact us