Two local zero-sum problems
Abstract
In the present paper, we investigate two local zero-sum problems. Let n,k 2. We denote by D*(n,nk) (resp. η*(n,nk)) the smallest positive integer (if exists) such that, from any given integers not divisible by n, one can select some (resp. at most n) of them whose sum is divisible by n but not by nk. We prove that both D*(n,nk) and η*(n,nk) are equal to 2n-1 if rad(n) rad(k) and infinite otherwise. The corresponding inverse problem is also determined. We denote by Dn× (resp. ηn×) the smallest positive integer such that, from any given integers coprime to n, one can select some (resp. at most n) of them whose sum σ satisfies (σ, n2)=n. We prove that Dn×=ηn×=2n-1 if n is a prime power, and determine its inverse problem.
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.