Two local zero-sum problems
Number Theory
2026-07-13 v1 Combinatorics
Abstract
In the present paper, we investigate two local zero-sum problems. Let . We denote by (resp. ) the smallest positive integer (if exists) such that, from any given integers not divisible by , one can select some (resp. at most ) of them whose sum is divisible by but not by . We prove that both and are equal to if and infinite otherwise. The corresponding inverse problem is also determined. We denote by (resp. ) the smallest positive integer such that, from any given integers coprime to , one can select some (resp. at most ) of them whose sum satisfies . We prove that if is a prime power, and determine its inverse problem.
Cite
@article{arxiv.2607.11313,
title = {Two local zero-sum problems},
author = {Gao Weidong and Jiang Xiao and Mu Yucen},
journal= {arXiv preprint arXiv:2607.11313},
year = {2026}
}