Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the modular Erdős-Burgess constant

Published 19 Jul 2018 in math.CO and math.NT | (1807.07266v1)

Abstract: Let nn be a positive integer. For any integer aa, we say that aa is idempotent modulo nn if a<sup>2≡</sup>a(modn)a<sup>2\equiv</sup> a\pmod n. The nn-modular Erd\H{o}s-Burgess constant is the smallest positive integer ℓ\ell such that any ℓ\ell integers contain one or more integers whose product is idempotent modulo nn. We gave a sharp lower bound of the nn-modular Erd\H{o}s-Burgess constant, in particular, we determined the nn-modular Erd\H{o}s-Burgess constant in the case when nn is a prime power or a product of pairwise distinct primes.

Authors (3)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.