[OK] 1/(N-t) >= 1/N + t/N^2 for 1 <= N <= 300, 0 <= t < N
[OK] f increasing on integers 0..n(n-1), 3 <= n <= 60
[OK] f(m) >= m/n + m^2/(2n^3), 3 <= n <= 60, 0 <= m <= n(n-1)
[OK] (3.2) exact for all 3 <= n <= 30, 2 <= i <= n(n-1), 0 <= c <= i-2  (violations: 0)
[OK] -log(1-h) <= h + h^2 on a grid of [0,1/2]
[OK] e^x - 1 <= 2x at x = 1 (convexity gives [0,1])
[OK] q_L <= 2/n for 8 <= n <= 10^5 (L = floor(n/4))
[OK] 1/(n-1-L) <= 2/n for 4 <= n <= 10^5
[OK] Range I brackets for 10 <= n <= 10^5 (the paper uses n >= 10)
[OK] E e^(C/8) <= exp(1/8 + e^(1/8) - 1) = 1.294531 <= 1.2946 (n = 2..2*10^5, max 1.294529)
[OK] 2 e^1.5 * 1.3 = 11.6524 <= 12
[OK] E e^(C+2) <= e^(2+e) = e^4.71828 <= e^4.72
[OK] n^2/64 >= 8 iff n >= 23 (n = 22 fails, n = 23 holds)
[OK] (n^2/64)^2/(8 n^3) = n/32768
[OK] sum_{m>=M} x^m/m! <= (x^M/M!) e^x  (x = e, M = 0..60)
[OK] (e/8)^(1/4) e^(1/64) = 0.77551 < 1
      epsilon_n at n = 10^3, 10^4, 10^5, 6*10^5, 10^6: 1.23e+06, 8.27e+05, 5.3e+05, 0.751, 6.26e-06
      epsilon_n < 1 from about n = 590087 on (checked on a grid up to 2*10^6)
[OK] epsilon_n < 1 for all n in [first_good, 2*10^6] (grid step 97)
[OK] P(C = c) <= 1/(c-1)! and E C = 2 - 2/n, 3 <= n <= 40 (exact)
ALL CHECKS PASSED
