A generalization of a classical zero-sum problem (Q879346): Difference between revisions

For \(n\in\mathbb N\) is \(\omega(n)\) the number prime divisors, and \(\Omega(n)\) the number of prime power divisors \((>1)\) of \(n\). Further let \(U(\mathbb Z/n\mathbb Z)\) the multiplicative group modulo \(n\). Here is proved the following theorem: If \(A= \{a_1,\dots,a_{n+\Omega(n)}\}\) is a sequence of integers, then there exists a subset \(M\subset\{1,\dots,n+ \Omega(n)\}\) of cardinality \(n\) such that the equation \(\sum_{i\in M} a_1x_i\equiv O\pmod n\) has a solution \((x_i)_{i\in M}\in (U(\mathbb Z/n \mathbb Z))^n\). This proves a conjecture of \textit{S. D. Adhikari, Y. G. Chen, J. B. Friedlander, S. V. Konyagin} and \textit{F. Pappalardi} [Contributions to zero-sum problems, Discrete Math. 306, No. 1, 1--10 (2006; Zbl 1161.11311)].