() in sets, Not associative & commutative
XOR  
Simplification(Circuits)
height of tree(n  elements )  2h 1  n  1  2h
h  1  log 2 (n  1)  h
Binomial Theorem
Pascal's Identity
Complete Graph, simple graph where every pair
of vertices is adjacent.Complete graphs with n vertices
represented by symbol Kn
Maxedges(m aryh levels)  mmh111
h(tree  height )  log 2 (n  1)
With exclusion= no box contains > 1 obj
Distinguishable= obj/boxes--marked some way; each one distinguishable from the other.
Without exclusion=box may contain >1 obj
Indistinguishable =objs/box identical