Logichard
0:00.0

Let BB be a finite Boolean algebra of cardinality 64. Let xBx \in B be an element represented as the join (supremum) of exactly 3 distinct atoms of BB, and let yBy \in B be an element represented as the join of exactly 4 distinct atoms of BB. How many pairs (x,y)(x, y) satisfy xy=0x \land y = 0, where 00 is the bottom element of the Boolean algebra?