ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnp_n denote the nnth prime number, and let α,β≥0\alpha,\beta\geq 0 satisfy α+β<1\alpha+\beta<1. Consider the weighted difference pnβ(pn+1α−pnα)p_n^\beta(p_{n+1}^\alpha-p_n^\alpha).

Weighted power-gap conjecture. There exists a constant C(α,β)C(\alpha,\beta) such that

pnβ(pn+1α−pnα)≤C(α,β)p_n^\beta\bigl(p_{n+1}^\alpha-p_n^\alpha\bigr)\leq C(\alpha,\beta)

for all nn.

The source presents this as a stronger conjecture suggested by the heuristic consequences of Cramér's conjecture. It remains open; the paper proves only the weaker liminf statement with the same parameter range.

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.