Let be any set:
An operation on is a rule which assigns to each ordered pair of elements of exactly one element in
If, for example, is a set consisting of just two distinct elements, say and , each operation on may be described by a table such as the one below:
Where could be either of the elements of ( or ) for any in . In general, there are many possible operations on a given set. A set containing just two elements for example, has possible operations.
How many possible operations are there on a set containing elements?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Consider a set A with n distinct elements, a 1 , a 2 , a 3 , ⋯ , a n . For each time an element, a i , is the first element of an ordered pair, all n elements can be the second one. Since this happens n times (for n elements) there are n ( n ) = n 2 possible ordered pairs of elements of A in which a i is the first element ( i ∈ Z + ≤ n ) . Thus, there are n 2 possible ordered pairs of elements of A .
Since every operation on A must assign a unique element of A to each ordered pair of elements of A , we have n possible values of a i ∗ a j , where ∗ is the operation and i , j ∈ Z + ≤ n . This suggests that there are n possible operations for each ordered pair of elements of A . Given that there are n 2 possible ordered pairs of elements of A , it can thus be seen that there are n 2 terms n × n × n × ⋯ × n = n n 2 possible operations on A .