Back to search
South Dakota State University
On Zero-Sum Rado Numbers for the Equation ax_1 + x_2 = x_3
Abstract
dc:description.abstractFor every positive integer $a$, let n = RZS(a) be the least integer, provided it exists, such that for every coloring \[ \Delta : \{1, 2, ..., n\} \rightarrow \{0, 1, 2\},\] there exist three integers x1, x2, x3 (not necessarily distinct) such that \[ \Delta(x_1) + \Delta(x_2) + \Delta(x_3) \equiv 0\ (mod\ 3) \] and \[ ax_1 +x_2 = x_3.\] If such an integer does not exist, then RZS(a) = \infty. The main results of this paper are \[R_{ZS}(2) = 12\] and a lower bound is found for RZS(a) where $a \geq 2$.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - Open Access
- Discipline thesis:degree_discipline
- Mathematics and Statistics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Brown, Nicholas
- Contributors dc:contributor
-
- Daniel Schaal
- Donald Vestal
Subjects
dc:subject × 1Rights
dc:rights- Language dc:language
- en
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd/1719