P

Initializing...

Proof of Theorem 1, pp. ec1–ec2 — the balanced tree (EC.1)–(EC.4) has 2^N leaves, one per assortment, depth N + 1, and satisfies Requirement 3 · Prove2Me