Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Determination of 2-color zero-sum generalized Schur Numbers (1803.00861v2)

Published 2 Mar 2018 in math.CO

Abstract: Consider the equation $\mathcal{E}: x_1+ \cdots+x_{k-1} =x_{k}$ and let $k$ and $r$ be positive integers such that $r\mid k$. The number $S_{\mathfrak{z},2}(k;r)$ is defined to be the least positive integer $t$ such that for any 2-coloring $\chi: [1, t] \to {0, 1}$ there exists a solution $(\hat{x}1, \hat{x}_2, \ldots, \hat{x}_k)$ to the equation $\mathcal{E}$ satisfying $\displaystyle \sum{i=1}k\chi(\hat{x}_i) \equiv 0\pmod{r}$. In a paper, the first author posed the question of determining the exact value of $S_{\mathfrak{z}, 2}(k;4)$. In this article, we solve this problem and show, more generally, that $S_{\mathfrak{z}, 2}(k, r)=kr - 2r+1$ for all positive integers $k$ and $r$ with $k>r$ and $r \mid k$.

Summary

We haven't generated a summary for this paper yet.