ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a(x)a(x) count BCC primes p≤xp\leq x satisfying p≡1(mod4)p\equiv1\pmod4, and define

I(x)=∫2xc dt(ln⁡t)3/2.I(x)=\int_2^x\frac{c\,dt}{(\ln t)^{3/2}}.

Let

C2+=∏q≡1(mod4)(1−1(q−1)2),C_2^+=\prod_{q\equiv1\pmod4}\left(1-\frac{1}{(q-1)^2}\right),

where the product is over primes q≡1(mod4)q\equiv1\pmod4, and let c′c' be the constant given by

c′=2C2+c=∏q≡1(mod4)(1−1(q−1)2)eγπ C(4,1).c'=2C_2^+c=\prod_{q\equiv1\pmod4}\left(1-\frac{1}{(q-1)^2}\right)\sqrt{\frac{e^{\gamma}}{\pi}}\,C(4,1).

BCC-prime asymptotic conjecture. As x→∞x\to\infty,

a(x)∼2C2+I(x)=c′∫2xdt(ln⁡t)3/2.a(x)\sim2C_2^+I(x)=c'\int_2^x\frac{dt}{(\ln t)^{3/2}}.

The formula is the paper’s Hardy–Littlewood-style heuristic prediction for the refined BCC-prime counting function, supported by the computational data presented there.

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.