| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 1 Feb 2008 12:13:56 IST
|
|
|
S is a set with "n" elements n>0.the no. of binary operations that can be defined in S?
|
|
|
|
1 Feb 2008 12:14:54 IST
|
|
|
2^n
|
" 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:16:55 IST
|
|
|
i have asked binary operations not functions.
the ans is n ^n^2
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
3 Feb 2008 12:47:37 IST
|
|
|
hii
yaar whats the question .. i am a bit non clear about it .. wat do u want to knw .. a set with numebrs like .. 1,2,3, ... n .. thn wat is the concept of bin operators ..
i am probably misunderstanding the question ..
cheers
|
Puneet Agrawal
IIT Delhi
|
this reply: 0 points
(with 0
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
3 Feb 2008 15:15:11 IST
|
|
|
to define a binary operation , we have to define the values the operation takes for all values (x,y) where x,y belongs to S
this means that n*n operations have to be defined.
Each of the operations can take n values.
So total no. of operations = nn2
|
this reply: 2 points
(with 0
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
Moderation Team
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
2
