On the modular Erdős-Burgess constant

Abstract

Let $n$ be a positive integer. For any integer $a$, we say that $a$ is idempotent modulo $n$ if $a^2\equiv a(\mathrm{mod}n)$. The $n$-modular Erdős-Burgess constant is the smallest positive integer $\ell$ such that any $\ell$ integers contain one or more integers whose product is idempotent modulo $n$. We gave a sharp lower bound of the $n$-modular Erdős-Burgess constant, in particular, we determined the $n$-modular Erdős-Burgess constant in the case when $n$ is a prime power or a product of pairwise distinct primes.

6 pages