The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
40 views

What Is The Total Number Of Boolean Functions Possible Over N Boolean Variables?

asked in Set Theory & Algebra by (83 points) | 40 views
+1
$2^{2^{n}}$
0
Can you explain bit more? :)

1 Answer

+1 vote
Best answer
Let's take 3 boolean variables for easy understanding .

a,b and c.

Each of the boolean variable can take 2 values , 0 and 1.

Thus total number of combinations possible for min terms = 2x2x2 = 8

And what are these? a'b'c' , a'b'c .... correct?

How to create boolean functions now ?

f(a,b,c) = Sum of min terms(you can also take Product of max terms , no issue :) ).

Each min term has two possibilities , either it can be in the function or not.

Thus total number of functions possible = $2^{Number of min terms}$ = $2^{2^{3}}$.

Similarly you can do it for n variables.
answered by Loyal (5.5k points)
selected by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,811 questions
54,540 answers
188,429 comments
75,596 users