Skip to content

Erdős problem 279

Let k3k\geq 3. Is there a choice of congruence classes ap(modp)a_p\pmod{p} for every prime pp such that all sufficiently large integers can be written as ap+tpa_p+tp for some prime pp and integer tkt\geq k?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:2992c2f6c9a11b42c8fd07ddb3b8639aeb90ce54e84139198a4bf08f3b8d0cf5
Metadata
sha256:449b412ee08381bf826ce5702b13461626fcde45bcbcdc5972bf303e6a2eafc7
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:dd60133717ab2dcd25c2de76a589cd629183444c5d00aebc3d666079e16b3e67
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page