q = 1/4: max_k k qh^(2k-2) = 9/8 at k = 2
   k = 1: D(OR_k) = 1 (1.000000), D(AND_k) = 1 (1.000000)
   k = 2: D(OR_k) = 9/8 (1.125000), D(AND_k) = 1/8 (0.125000)
   k = 3: D(OR_k) = 243/256 (0.949219), D(AND_k) = 3/256 (0.011719)
   k = 4: D(OR_k) = 729/1024 (0.711914), D(AND_k) = 1/1024 (0.000977)
   equality at k* = 2: OR True, AND False
   n = 2: max over Boolean f = 9/8 (= max_(k<=n) k qh^(2k-2): True); 2 maximisers, 2 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
   n = 3: max over Boolean f = 9/8 (= max_(k<=n) k qh^(2k-2): True); 6 maximisers, 6 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
   n = 4: max over Boolean f = 9/8 (= max_(k<=n) k qh^(2k-2): True); 12 maximisers, 12 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
q = 2/5: max_k k qh^(2k-2) = 1 at k = 1
   k = 1: D(OR_k) = 1 (1.000000), D(AND_k) = 1 (1.000000)
   k = 2: D(OR_k) = 18/25 (0.720000), D(AND_k) = 8/25 (0.320000)
   k = 3: D(OR_k) = 243/625 (0.388800), D(AND_k) = 48/625 (0.076800)
   k = 4: D(OR_k) = 2916/15625 (0.186624), D(AND_k) = 256/15625 (0.016384)
   equality at k* = 1: OR True, AND True
   n = 2: max over Boolean f = 1 (= max_(k<=n) k qh^(2k-2): True); 4 maximisers, 0 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
   n = 3: max over Boolean f = 1 (= max_(k<=n) k qh^(2k-2): True); 6 maximisers, 0 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
   n = 4: max over Boolean f = 1 (= max_(k<=n) k qh^(2k-2): True); 8 maximisers, 0 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
q = 3/5: max_k k qh^(2k-2) = 1 at k = 1
   k = 1: D(OR_k) = 1 (1.000000), D(AND_k) = 1 (1.000000)
   k = 2: D(OR_k) = 8/25 (0.320000), D(AND_k) = 18/25 (0.720000)
   k = 3: D(OR_k) = 48/625 (0.076800), D(AND_k) = 243/625 (0.388800)
   k = 4: D(OR_k) = 256/15625 (0.016384), D(AND_k) = 2916/15625 (0.186624)
   equality at k* = 1: OR True, AND True
   n = 2: max over Boolean f = 1 (= max_(k<=n) k qh^(2k-2): True); 4 maximisers, 0 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
   n = 3: max over Boolean f = 1 (= max_(k<=n) k qh^(2k-2): True); 6 maximisers, 0 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
   n = 4: max over Boolean f = 1 (= max_(k<=n) k qh^(2k-2): True); 8 maximisers, 0 of them +-OR of >= 2 bits, 0 +-AND of >= 2 bits
q = 3/4: max_k k qh^(2k-2) = 9/8 at k = 2
   k = 1: D(OR_k) = 1 (1.000000), D(AND_k) = 1 (1.000000)
   k = 2: D(OR_k) = 1/8 (0.125000), D(AND_k) = 9/8 (1.125000)
   k = 3: D(OR_k) = 3/256 (0.011719), D(AND_k) = 243/256 (0.949219)
   k = 4: D(OR_k) = 1/1024 (0.000977), D(AND_k) = 729/1024 (0.711914)
   equality at k* = 2: OR False, AND True
   n = 2: max over Boolean f = 9/8 (= max_(k<=n) k qh^(2k-2): True); 2 maximisers, 0 of them +-OR of >= 2 bits, 2 +-AND of >= 2 bits
   n = 3: max over Boolean f = 9/8 (= max_(k<=n) k qh^(2k-2): True); 6 maximisers, 0 of them +-OR of >= 2 bits, 6 +-AND of >= 2 bits
   n = 4: max over Boolean f = 9/8 (= max_(k<=n) k qh^(2k-2): True); 12 maximisers, 0 of them +-OR of >= 2 bits, 12 +-AND of >= 2 bits
q = 4/5: max_k k qh^(2k-2) = 32/25 at k = 2
   k = 1: D(OR_k) = 1 (1.000000), D(AND_k) = 1 (1.000000)
   k = 2: D(OR_k) = 2/25 (0.080000), D(AND_k) = 32/25 (1.280000)
   k = 3: D(OR_k) = 3/625 (0.004800), D(AND_k) = 768/625 (1.228800)
   k = 4: D(OR_k) = 4/15625 (0.000256), D(AND_k) = 16384/15625 (1.048576)
   equality at k* = 2: OR False, AND True
   n = 2: max over Boolean f = 32/25 (= max_(k<=n) k qh^(2k-2): True); 2 maximisers, 0 of them +-OR of >= 2 bits, 2 +-AND of >= 2 bits
   n = 3: max over Boolean f = 32/25 (= max_(k<=n) k qh^(2k-2): True); 6 maximisers, 0 of them +-OR of >= 2 bits, 6 +-AND of >= 2 bits
   n = 4: max over Boolean f = 32/25 (= max_(k<=n) k qh^(2k-2): True); 12 maximisers, 0 of them +-OR of >= 2 bits, 12 +-AND of >= 2 bits
q = 9/10: max_k k qh^(2k-2) = 43046721/20000000 at k = 5
   k = 1: D(OR_k) = 1 (1.000000), D(AND_k) = 1 (1.000000)
   k = 2: D(OR_k) = 1/50 (0.020000), D(AND_k) = 81/50 (1.620000)
   k = 3: D(OR_k) = 3/10000 (0.000300), D(AND_k) = 19683/10000 (1.968300)
   k = 4: D(OR_k) = 1/250000 (0.000004), D(AND_k) = 531441/250000 (2.125764)
   n = 2: max over Boolean f = 81/50 (= max_(k<=n) k qh^(2k-2): True); 2 maximisers, 0 of them +-OR of >= 2 bits, 2 +-AND of >= 2 bits
   n = 3: max over Boolean f = 19683/10000 (= max_(k<=n) k qh^(2k-2): True); 2 maximisers, 0 of them +-OR of >= 2 bits, 2 +-AND of >= 2 bits
   n = 4: max over Boolean f = 531441/250000 (= max_(k<=n) k qh^(2k-2): True); 2 maximisers, 0 of them +-OR of >= 2 bits, 2 +-AND of >= 2 bits
A41F_PASS
