ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Define ϵn\epsilon_n to be maximal such that there exists some choice of congruence class apa_p for all primes nϵn<p≤nn^{\epsilon_n}<p\leq n such that every integer in [1,n][1,n] satisfies at least one of the congruences ≡ap(modp)\equiv a_p\pmod{p}. Estimate ϵn\epsilon_n - in particular is it true that ϵn=o(1)\epsilon_n=o(1)?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.