calcolo BOOLEANO combinatorio in informatica
//How many combinations-possibilities to cover for n boolean variables?
// number of variables [k] , 2 possibilities(TRUE OR FALSE) [n]
// in other words: n boolean vars = n bit (1 bit 2 states: 0 and 1)
// I.E. I have 3 variables each of which can have 1 value of 2: true or false
// n possibilities as base
// k variable as power
2^3=8
// in combinational analysis this is called: distribution with repetition
// (n^k) AA BB AB BA or 11 00 10 01 in boolen calculation(our true/false case)