In the below article, we are going to find the number of Boolean Functions possible from the given sets of binary number.

**Statement-1:**

Suppose two sets are set ‘A’ = {1, 2, 3, 4, …….., n} where each number will be either ‘0’ or ‘1’ and hence the total number of boolean variable possible will be and set ‘B’ = {0, 1}. Now the number of possible boolean function when counting is done from set ‘A’ to ‘B’ will be .

**Explanation:**

As we know that boolean variable is either ‘0’ or ‘1’ and in the set ‘A’ there are ‘n’ numbers and each number will be either ‘0’ or ‘1’ and hence the total number of possible boolean variable are . Now set ‘A’ contain boolean variable and set ‘B’ contain 2 boolean variable.

This can be understood with help of below diagram:

Each element of set ‘A’ makes a function with each element of set ‘B’ hence one element of set ‘A’ makes two function with set ‘B’ and hence total number of possible boolean functions are where is the number of element in set ‘A’.

**Statement-2:**

Suppose two sets of ternary variable are set ‘A’ = {1, 2, 3, 4, …….., n} where each number will be either ‘0’ or ‘1’ or ‘2’ and hence the total number of ternary variable possible will be and set ‘B’ = {0, 1}. Now the number of possible boolean function when counting is done from set ‘A’ to ‘B’ will be .

**Explanation:**

As we know that ternary variables are ‘0’ or ‘1’ or ‘2’ and in the set ‘A’ there are ‘n’ numbers and each number will be either ‘0’ or ‘1’ or ‘2’ and hence the total number of possible ternary variables are . Now set ‘A’ contain ternary numbers and set ‘B’ contain 2 boolean variable.

This can be understood with help of below diagram:

Each element of set ‘A’ makes a function with each element of set ‘B’ hence one element of set ‘A’ makes two functions with set ‘B’ and hence the total number of possible boolean functions are where is the number of elements in set ‘A’.

**Note:**

Similarly for a set ‘A’ of ‘n’ numbers of k-ary variable and set ‘B’ of p-ary variable then the total number of p-ary possible function will be .

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- Representation of Boolean Functions
- Minimization of Boolean Functions
- Prime Implicant chart for minimizing Cyclic Boolean functions
- Mathematics | Unimodal functions and Bimodal functions
- Inverse functions and composition of functions
- Total Recursive Functions and Partial Recursive Functions in Automata
- Properties of Boolean Algebra
- Counting Boolean function with some variables
- Boolean Algebraic Theorems
- Proof of De-Morgan's laws in boolean algebra
- Mathematics | Total number of possible functions
- Number of possible Functions
- Mathematics | Classes (Injective, surjective, Bijective) of Functions
- Discrete Maths | Generating Functions-Introduction and Prerequisites
- Activation Functions
- Mathematics | Generating Functions - Set 2
- Functions of Operating System
- Self Dual functions in Digital Logic
- Hyperbolic Functions
- Trigonometric Functions in Latex

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.