How many different Boolean functions are there for n Boolean variables?

# Digital logic: functions

**arjya11**#2

Total no. Of Boolean Variables = n (Given)

So, Total no. of possible input combinations using those n Boolean Variables = 2^n

For each input combination we can have 2 choices – True or False (0 or 1).

So, for each of those 2^n input sequence we have 2 choices (0 or 1).

Then, Total no. of possible Boolean Functions = 2^(2^n )