**NOTATION**:   $P(x)$   stands for the product of all primes which do not exceed real   $x$;   e.g.   $P(10)=210$.

**QUESTION**:   Given any real   $x\ge 3$,   compute or estimate the smallest natural number   $n:=n(x)\ge 3$   such the remainder of the division of   $n$   by any odd prime   $p\le x$   is   $1$ or $2$   (it may be any combination of   $1$s   and   $2$s).

In particular, improve upon my simple theorem below, and still better upon its consecutive improvements provided by the MO participants.

**THEOREM**
$$ n(x)\ > \ \sqrt{P(x)} $$

**EXAMPLEs** (small calculations):

 - $n(3) = 4$
 - $n(5) = 7$
 - $n(7) = 16$

**REMARK (warning)**: First I talk about **all** primes (see **NOTATION**), then about **odd** primes (see **QUESTION**).