Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Logichard
0:00.0

A Boolean function f:{0,1}n→{0,1}f: \{0, 1\}^n \to \{0, 1\}f:{0,1}n→{0,1} is monotone if for any x,y∈{0,1}nx, y \in \{0, 1\}^nx,y∈{0,1}n, x≤yx \le yx≤y (component-wise) implies f(x)≤f(y)f(x) \le f(y)f(x)≤f(y). The number of monotone Boolean functions of nnn variables is known as the nnn-th Dedekind number. What is the number of monotone Boolean functions of 333 variables?