Skip to published state

finding record / erdos

recorded

vf_fadff50b7d3b3ed2

Erdős Problem #676

Canonical assertion

declared status 'open'. Formalized: no. Is every sufficiently large integer of the formap2+bap^2+bfor some prime pp and integer a1a\geq 1 and 0b<p0\leq b<p? Current best: Most generally, given some infinite set ANA\subseteq \mathbb{N} and function f:ANf:A\to \mathbb{N} one can ask for sufficient conditions on AA and ff that guarantee every large number (or almost all numbers) can be written asam2+bam^2+bfor some mAm\in A and a1a\geq 1 and 0b<f(m)0\leq b<f(m). In another direction, one can ask what is the minimal cnc_n such that nn can be written as n=ap2+bn=ap^2+b with 0b<cnp0\leq b<c_np for some pnp\leq \sqrt{n}. This problem asks whether cn1c_n\leq 1 eventually, but in [Er79d] Erd\H{o}s suggests that in fact lim supcn=\limsup c_n=\infty. Prize: no. OEIS: A390181. Tags: number theory.

Notation is rendered from the stored source. The pinned checkout remains the exact record.

  1. database_record
  2. theoretical
  3. 0 spans
  4. recorded
Provenance summary
erdos_deep:676
database_record
Jun 16, 2026, 12:00 AM
not recorded
0
Exact record identityFinding ID, frontier identity, and pinned Git source
vf_fadff50b7d3b3ed2
vfr_0a25edabc16db143
ce8ba7d934c848408e0d91caca39e938698e3fc7
03f7371b496485f761f91961027fd48198dc7e93
Exact source and rootsGit ce8ba7d934c8 and content-addressed ledgers
Commit
ce8ba7d934c848408e0d91caca39e938698e3fc7
Tree
03f7371b496485f761f91961027fd48198dc7e93
Committed
2026-07-20T19:20:20-04:00
Repository
Open source
Event log
sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde
Snapshot
sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56
Proposals
sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f
Actor registry
sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b
Artifacts
sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da