Question 1: Prove that every Boolean function f ( xn 1 , xn 2 ,...

, x1 , x0 ) of n variables can be written in either of the forms: Canonical sun-of-products: f ( xn 1 , xn 2 ,..., x1 , x0 ) = K =0 K mK

2n 1

Canonical product-of-sums: f ( xn 1 , xn 2 ,..., x1, x0 ) = K =0 ( K + M K )

2n 1

where:
mK is the K th minterm, 0 K 2 n 1 M K is the K th maxterm, 0 K 2n 1

K = K = f ( kn 1 , kn 2 ,..., k1 , k0 ) and ( kn 1 , kn 2 ,..., k1 , k0 ) is the binary

representation of the decimal number 0 K 2 n 1 . Question 2: Proof that XOR function is odd, namely,
1 if number of 1's is odd f ( xn 1 , xn 2 ,..., x1 , x0 ) = 0 otherwise

Proof that EQUIVALANCE function is even, namely,

1 if number of 0's is even f ( xn 1 , xn 2 ,..., x1 , x0 ) = 0 otherwise