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

Let BBB be a finite Boolean algebra of cardinality 64. Let x∈Bx \in Bx∈B be an element represented as the join (supremum) of exactly 3 distinct atoms of BBB, and let y∈By \in By∈B be an element represented as the join of exactly 4 distinct atoms of BBB. How many pairs (x,y)(x, y)(x,y) satisfy x∧y=0x \land y = 0x∧y=0, where 000 is the bottom element of the Boolean algebra?