A counterexample to a conjecture of S\'ark\"ozy on sums and products modulo a prime

Abstract

Let p be a prime and, for A⊂eq Fp, define A=(A+A)(AA). S\'ark\"ozy conjectured that there exist constants c>0 and p0 such that, for every prime p>p0, every set A⊂eq Fp with |A|>(12-c)p satisfies Fp×⊂eq A. We disprove this conjecture: for every odd prime p 5, there exists a set A⊂eq Fp with |A|=p-12 such that 1 A. Thus no positive constant c can satisfy S\'ark\"ozy's conjecture. Conversely, if |A|>p2, then A+A= Fp. Therefore the sharp threshold is exactly 12.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…