*"If you fix the number of input variables, there are a finite number of unique boolean functions possible. For example, there are only 16 unique boolean functions with two inputs and there are only 256 boolean functions of 3 input variables. Given*n

*there are 2**(2 to the nth power)(two raised to the two raised to the*n

*th power) unique boolean functions of those*n

*input variables. For two input variables, 2^(2*2)=2 to the 4th power or 16 different functions..."*Now I don''t know a whole lot of math, at least not at this guy''s level. What does he mean by 2 raised to the 2... blah blah blah? If anyone knows what I''m talking about, can someone translate it for me? I can see from the context that there is a pattern-- 2 input variables would mean 16 possible functions; 3 inputs would mean 256; 4 would mean 65356. What is it exactly?