Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

A very simple exercice

Status
Not open for further replies.

lahrach

Full Member level 3
Joined
Feb 6, 2009
Messages
170
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,296
Activity points
2,285
Hi friends,

Can some one show that there are (2)(2)(n) distinctly different boolean functions with n inputs?

regards
 

keremcant

Member level 5
Joined
Dec 25, 2009
Messages
87
Helped
6
Reputation
12
Reaction score
5
Trophy points
1,288
Activity points
1,910
can you make the question more clear?
 

Alexium

Full Member level 2
Joined
Jan 6, 2011
Messages
148
Helped
39
Reputation
78
Reaction score
39
Trophy points
1,308
Location
Ukraine
Activity points
2,163
Boolean function is described by it's truth table. More specifically - by it's Y row. Consider 2-AND:

x1x2 y
0 0 0
0 1 0
1 0 0
1 1 1

As you can see, the function is determined by the Y vector (bit vector), which has a length of 2^n. And, as you should now, a binary vector of length 2^n can take 2^(2^n) possible states.
That's it!
 
Last edited:
Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top