Skip to published state

Erdős problem / erdos

no open offer

Problem 676

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_fadff50b7d3b3ed2

    theoretical

    Erdős Problem #676: 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.

    recordedOpen record