Counting Possible Operations

Algebra Level 4

Let A A be any set:

An operation * on A A is a rule which assigns to each ordered pair ( a , b ) (a,b) of elements of A A exactly one element a b a*b in A . A.

If, for example, A A is a set consisting of just two distinct elements, say a a and b b , each operation on A A may be described by a table such as the one below:

( x , y ) (x,y) x y x*y
( a , a ) (a,a)
( a , b ) (a,b)
( b , a ) (b,a)
( b , b ) (b,b)

Where x y x*y could be either of the elements of A A ( a a or b b ) for any ( x , y ) (x,y) in A A . In general, there are many possible operations on a given set. A set containing just two elements for example, has 16 16 possible operations.

How many possible operations are there on a set containing n n elements?

2 n 2^n 2 n 2 2^{n^2} n 2 n^2 n 3 n^3 n n n^n n n 2 n^{n^2}

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.

1 solution

Akeel Howell
Sep 7, 2017

Consider a set A A with n n distinct elements, a 1 , a 2 , a 3 , , a n a_1,a_2,a_3, \cdots, a_n . For each time an element, a i a_i , is the first element of an ordered pair, all n n elements can be the second one. Since this happens n n times (for n n elements) there are n ( n ) = n 2 n(n) = n^2 possible ordered pairs of elements of A A in which a i a_i is the first element ( i Z + n ) (i \in \mathbb{Z^+} \leq n) . Thus, there are n 2 n^2 possible ordered pairs of elements of A A .

Since every operation on A A must assign a unique element of A A to each ordered pair of elements of A A , we have n n possible values of a i a j a_i*a_j , where * is the operation and i , j Z + n i,j \in \mathbb{Z^+} \leq n . This suggests that there are n n possible operations for each ordered pair of elements of A A . Given that there are n 2 n^2 possible ordered pairs of elements of A A , it can thus be seen that there are n × n × n × × n n 2 terms = n n 2 \underbrace{n \times n \times n \times \cdots \times n}_{n^2 \text{ terms }} = n^{n^2} possible operations on A A .

When you say "a set A A ", this implicitly assumes that the elements of A A are distinct (since the definition of set doesn't allow repeated elements). A simple thing to note is that an operator \ast on A A is basically a map : A × A A \ast\colon A\times A\to A and it thus follows that there are A A × A = n n × n = n n 2 |A|^{|A\times A|}=n^{n\times n}=n^{n^2} such maps (a map f : X Y f\colon X\to Y can be constructed in Y X |Y|^{|X|} ways).

Prasun Biswas - 3 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...