Skip to published state

Erdős problem / erdos

open offer

Problem 971

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 17
availableerdos:971
Erdős 971
Advance Erdős problem 971 from its pinned statement, theorem and proof records, attempts, residual obligations, dependency context, and source locks; produce one decision-relevant artifact or an informative negative result without repeating banked routes.
  1. Targeterdos:971
  2. Packetsite/problems/971.json
  3. Verifiererdos-frontier.problem-work.v1
Inspect ranked work
Exact offer contractPacket, root, and verifier profile
Verifier
erdos-frontier.problem-work.v1
Packet
site/problems/971.json
Packet root
sha256:12f4873d687f74cdaaaa41cf49f42c3f6ce2e94a6ab0d241736b5a16f97e428a

Matching finding records

1 records

  1. vf_cf519abfaf881fbc

    theoretical

    Erdős Problem #971: declared status 'open'. Formalized: yes. Let p(a,d)p(a,d) be the least prime congruent to a(modd)a\pmod{d}. Does there exist a constant c>0c>0 such that, for all large dd,p(a,d)>(1+c)ϕ(d)log⁡dp(a,d) > (1+c)\phi(d)\log dfor ≫ϕ(d)\gg \phi(d) many values of aa? Prize: no. OEIS: A226521. Tags: number theory.

    recordedOpen record