GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
120 views
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
asked in Combinatory by Veteran (29.1k points)   | 120 views

1 Answer

+3 votes
Best answer

Given , the cardinality of set = n

So consequently ,

No of entries in operation table(Cayley table)  =  n2

And hence if we consider lower triangular or upper triangular half , we have : (n2 + n) / 2

And in an operation table , each entry can be filled in n ways by any one element out of given n elements of the set..

So no of ways we can fill the upper or lower triangular half  =  n(n^2 + n)/2

So each of these is nothing but an instance of operation table of commutative operation as say (i,j) entry is filled in the table so (j,i) entry will also be the same hence the choice for (j,i) entry is constrained to 1 as we are concerned about commutativ operation table here..

Therefore,

No of possible binary operations which are commutative  = n(n^2 + n)/2

answered by Veteran (65.2k points)  
selected by
is it equal to symetric = A*B= B*A
Ya commutative means A * B = B * A as mentioned in the answer..
@HabibKhan: i have one doubt,,no. of symmetric relations possible in a set of n elements is$2^{(n2+n)/2}$

please correct me if i am wrong..
Ya it is fine ..But here the question is about no of binary operations which are commutative..
but isn't it right that no. of lower triangular entries =(n^2-n)/2
Ya it is true ..But then no problem..


Top Users Mar 2017
  1. rude

    5246 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1574 Points

  7. Bikram

    1444 Points

  8. Vignesh Sekar

    1440 Points

  9. Akriti sood

    1424 Points

  10. Sanjay Sharma

    1128 Points

Monthly Topper: Rs. 500 gift card

21,556 questions
26,907 answers
61,270 comments
23,278 users