As $n\to \infty$ ranges over integers $\sum_{p\leq n}1_{n\in (p/2,p)\pmod{p}}\frac{1}{p}\sim \frac{\log\log n}{2}$?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

1True ↔2  Asymptotics.IsEquivalent Filter.atTop3    (fun n => ∑ p ∈ Finset.range (n + 1) with Nat.Prime p ∧ ↑p / 2 < ↑n % ↑p, 1 / ↑p) fun n =>4    Real.log (Real.log ↑n) / 2

Reported activity

Reported by these sources. Not reviewed here.

• Valid but non-improving proofs

  GPT-Erdős

  Open the source record