Back to search
South Dakota State University
2-Color Rado Numbers for The Family of Equations x₁ + x₂ + ... xm-1 + c = (m - 1)xm
Abstract
dc:description.abstractFor every integer c and every positive integer m ≥ 3, let n = R(m, c) be the least integer, provided that it exists, such that for every coloring [special characters omitted]there exists integers x1, x2,...,xm (not necessarily distinct) such that [special characters omitted]and [special characters omitted]If such an integer does not exist, then let R( m, c) = ∞. The main result is that for every odd integer m ≥ 3 and every positive integer c [special characters omitted]
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - University Access Only
- Discipline thesis:degree_discipline
- Mathematics and Statistics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Mousel, Joe
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd2/1284