Polynomial Coefficient Bound Finder

Estimate the least c so that |C_k(1 / P((1-mx)/x))| < m^(c·k).

Assumption: C_k is the coefficient of x^k in the power series of 1 / P((1-mx)/x) around x = 0. We approximate the least c by testing random integer polynomials. Coefficient bounds are interpreted as multiples of m: aᵢ ∈ [coeffMin·m, coeffMax·m]. You can type a number (e.g. 0.5) or a factor like m, -m, 2m.

Degree min

Degree max

Coeff min factor

Coeff max factor

Random polynomials

Seed (optional)

m min (> 1)

m max

k min

k max

Status: Idle

Progress: —

Current max c: —

Worst case (current):

Polynomial:

—

m, k:

—

log |C_k|:

—