ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Bn,k(p)B_{n,k}(p) be the binomial tail probability, bn,k(p)b_{n,k}(p) the corresponding binomial point probability, and L(n,k,p)L(n,k,p) the lower bound from the paper's Theorem~. Suppose k,n∈N0k,n\in\mathbb{N}_0, k≤nk\leq n, and 0<p<10<p<1. Tail-ratio conjecture. The quantity

Bn,k(p)bn,k(p)L(n,k,p)\frac{B_{n,k}(p)}{b_{n,k}(p)L(n,k,p)}

is nondecreasing in kk and nonincreasing in nn and pp. In addition,

Bn,k(p)bn,k(p)<180451625143327232L(n,k,p)∀k≤pn,\frac{B_{n,k}(p)}{b_{n,k}(p)}<\frac{180451625}{143327232}L(n,k,p)\qquad\forall k\leq pn,

and

Bn,k(p)bn,k(p)<π2L(n,k,p)∀k≤pn−1.\frac{B_{n,k}(p)}{b_{n,k}(p)}<\sqrt{\frac{\pi}{2}}L(n,k,p)\qquad\forall k\leq pn-1.

The conjecture seeks a sharp description of the ratio between the binomial tail and point probabilities, improving the factor-two bounds established in the paper; the stated numerical constant is approximately 1.259021.25902, while the conjecture is proved only in a special case using a connection with Ramanujan's equation.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.