Question:

Let $S$ be a set containing $n$ elements. Then, number of binary operations on $S$ is

Updated On: Apr 15, 2024
  • $n^n$
  • $2^{n^{2}}$
  • $n^{n^{2}}$
  • $n^2$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

We know very well, that number of binary operations on at set $S$ having $n$ elements is $n^{n^{2}}$.
Was this answer helpful?
0
0

Concepts Used:

Functions

A function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output. Let A & B be any two non-empty sets, mapping from A to B will be a function only when every element in set A has one end only one image in set B.

Kinds of Functions

The different types of functions are - 

One to One Function: When elements of set A have a separate component of set B, we can determine that it is a one-to-one function. Besides, you can also call it injective.

Many to One Function: As the name suggests, here more than two elements in set A are mapped with one element in set B.

Moreover, if it happens that all the elements in set B have pre-images in set A, it is called an onto function or surjective function.

Also, if a function is both one-to-one and onto function, it is known as a bijective. This means, that all the elements of A are mapped with separate elements in B, and A holds a pre-image of elements of B.

Read More: Relations and Functions