| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 1 Feb 2008 12:10:43 IST
|
|
|
let A be a set of "n" distinct elements. the total no. of distinct onto functions from A toA?
|
|
|
|
1 Feb 2008 12:15:11 IST
|
|
|
n! first can take n values...second (n-1)...and so on to get n! rate if right..nudge if wrong
|
" Always remember money isn't everything but make sure you have made a lot of it before talking such nonsense!"
- Bill Gates |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 12:18:48 IST
|
|
|
i also think its right. cant be anything else
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 12:21:42 IST
|
|
|
it is wrong try the answer.
|
this reply: 5 points
(with 1
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 12:24:35 IST
|
|
|
do you mean A cross A
|
<TABLE CELLSPACING="1" CELLPADDING="1" BORDER="0">
<TR><TD>
<DIV ALIGN="right">Glitter Graphics</DIV></TD></TR></TABLE> |
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 12:25:49 IST
|
|
|
if you mean the above then the answer is n^2 elements
|
<TABLE CELLSPACING="1" CELLPADDING="1" BORDER="0">
<TR><TD>
<DIV ALIGN="right">Glitter Graphics</DIV></TD></TR></TABLE> |
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 12:29:40 IST
|
|
|
yes that ans was for 1-1 sorry now each one mustt have an image and other must have a preimage. ans 1st one in either n ways one one or nc2 (2-1) ....... total n+nc2 +nc3+........1 similarly for codomain part plz. rate me if right
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 13:21:34 IST
|
|
|
The ans is nn. Rate me if I m correct.I'll give u the solution if its the right ans.
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
1 Feb 2008 18:52:43 IST
|
|
|
this is also wrong
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
2 Feb 2008 12:41:49 IST
|
|
|
you can do it by considering the each element in the domain as sweets and the elements in the range to be students.now you have to distribute the n sweets among n students such rthat no student
is left empty handed and no sweet is left undistributed.
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
2 Feb 2008 15:18:49 IST
|
|
|
IF A AND B ARE TWO NON-EMPTY FINITE SETS CONTAINING m AND n ELEMENTS RESPECTIVELY......
THEN NO. OF ONTO FUNCTIONS FROM A TO B IS
[r=1 ] [n ] (-1)n-r ncr rm , m>=n .
here in your question m=n ........
nudge me if i am wrong.....
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
Moderation Team
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
