by v_Enhance, Apr 28, 2015, 9:13 PM
Let
, where
. Each of the

subsets of

is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set
, we then write

for the number of subsets of

that are blue.
Determine the number of colorings that satisfy the following condition: for any subsets

and

of
, ![\[ f(T_1)f(T_2) = f(T_1 \cup T_2)f(T_1 \cap T_2). \]](//latex.artofproblemsolving.com/1/8/1/18184e9196e6c73601653d85f1cfd6d9798a8e43.png)
This post has been edited 1 time. Last edited by v_Enhance, May 3, 2015, 11:55 AM
Reason: "colered"