On Brakemeier's variant of the Erdős-Ginzburg-Ziv problem

Rok, strany: 2000, 91 - 98

Let $n$ and $k$ be two integers such that $1≤ k ≤ n.$ Denote by $f(n,k)$ the smallest integer $g$ such that any sequence of $g$ integers belonging to exactly $k$ classes modulo $n,$ contains a subsequence of $n$ terms having its sum congruent to zero modulo $n.$ We establish new lower bounds of the function $f(n,k)$ for all values of $n$ and $k.$

ISO 690:

Gallardo, L., Grekos, G. 2000. On Brakemeier's variant of the Erdős-Ginzburg-Ziv problem. In Tatra Mountains Mathematical Publications, vol. 20, no.3, pp. 91-98. 1210-3195.

APA:

Gallardo, L., Grekos, G. (2000). On Brakemeier's variant of the Erdős-Ginzburg-Ziv problem. Tatra Mountains Mathematical Publications, 20(3), 91-98. 1210-3195.