Let $F (x)$ be maximal such that there exists, for all $n \leq x$ , a congruence class $a_{n} (mod n)$ such that every $m \leq x$ satisfies at least $F (x)$ of these congruences.Estimate $F (x)$ .

Worked, still open.

number theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved