== T_p (partitions without singletons), by enumeration
p= 2  T_p=1  (p/2)^p=1  T_p<=(p/2)^p: True
p= 4  T_p=4  (p/2)^p=16  T_p<=(p/2)^p: True
p= 6  T_p=41  (p/2)^p=729  T_p<=(p/2)^p: True
p= 8  T_p=715  (p/2)^p=65536  T_p<=(p/2)^p: True
p=10  T_p=17722  (p/2)^p=9765625  T_p<=(p/2)^p: True
== N(d,p) (least N >= 3 with N^(p/2-1) >= K(d,p))
p= 4  d=1: K=35.0000 N=35; d=2: K=145.8333 N=146; d=3: K=461.8056 N=462; d=5: K=3561.4390 N=3562; d=10: K=393597.1808 N=393598
p= 6  d=1: K=861.0000 N=30; d=2: K=5022.5000 N=71; d=3: K=22266.4167 N=150; d=5: K=336567.9560 N=581; d=10: K=200050392.2481 N=14144
p= 8  d=1: K=29493.7500 N=31; d=2: K=221203.1250 N=61; d=3: K=1260857.8125 N=109; d=5: K=31504855.0781 N=316; d=10: K=65790998143.6157 N=4037
p=10  d=1: K=1267123.0000 N=34; d=2: K=11615294.1667 N=59; d=3: K=80919882.6944 N=95; d=5: K=3020417434.3156 N=235; d=10: K=17203104842957.6738 N=2037
== thresholds n_0 (Step 1 of Theorem 1.4)
(p,d)=( 4,1) n_0=  4  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=4  largest real root in [3.2767, 3.2767]  degree=4 lead>0=True  -> OK
(p,d)=( 4,2) n_0= 20  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=20  largest real root in [19.2655, 19.2655]  degree=4 lead>0=True  -> OK
(p,d)=( 4,3) n_0= 54  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=54  largest real root in [53.3962, 53.3962]  degree=4 lead>0=True  -> OK
(p,d)=( 4,4) n_0=121  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=121  largest real root in [120.4661, 120.4661]  degree=4 lead>0=True  -> OK
(p,d)=( 6,1) n_0=  3  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=3  largest real root in [2.1199, 2.1199]  degree=6 lead>0=True  -> OK
(p,d)=( 6,2) n_0=  8  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=8  largest real root in [7.5526, 7.5526]  degree=6 lead>0=True  -> OK
(p,d)=( 6,3) n_0= 16  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=16  largest real root in [15.0648, 15.0648]  degree=6 lead>0=True  -> OK
(p,d)=( 6,4) n_0= 26  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=26  largest real root in [25.7254, 25.7254]  degree=6 lead>0=True  -> OK
(p,d)=( 8,1) n_0=  3  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=3  largest real root in [2.0201, 2.0201]  degree=8 lead>0=True  -> OK
(p,d)=( 8,2) n_0=  6  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=6  largest real root in [5.6432, 5.6432]  degree=8 lead>0=True  -> OK
(p,d)=( 8,3) n_0= 11  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=11  largest real root in [10.0218, 10.0218]  degree=8 lead>0=True  -> OK
(p,d)=(10,1) n_0=  3  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=3  largest real root in [2.0044, 2.0044]  degree=10 lead>0=True  -> OK
(p,d)=(10,2) n_0=  5  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=5  largest real root in [4.9448, 4.9448]  degree=10 lead>0=True  -> OK
(p,d)=( 4,5) n_0=245  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=245  largest real root in [244.9675, 244.9675]  degree=4 lead>0=True  -> OK
(p,d)=( 4,6) n_0=469  certificate=True  P(n_0-1)<=0 or n_0=3: True  least certified m=469  largest real root in [468.3279, 468.3279]  degree=4 lead>0=True  -> OK
ALL THRESHOLD CHECKS: PASS
== closed forms used without a computer in Section 6
E_iid(n,1,4)=(3n-1)/(30n^3): True; E_iid(n,1,6)=(9n^2-8n+2)/(84n^5): True; L-E_iid=f/(210n^3(n-1)): True; L-E_iid=g/(252n^5(n-1)): True; f=(n-4)(4n^2-5n+8)+25: True; f(3)=-4, g(3)=132
