A sharp monotonicity and upper-bound conjecture for binomial tail ratios
Statement
Let be the binomial tail probability, the corresponding binomial point probability, and the lower bound from the paper's Theorem~. Suppose , , and . Tail-ratio conjecture. The quantity
is nondecreasing in and nonincreasing in and . In addition,
and
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 , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.