{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-1592"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-1592","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Some 2-Color Rado Numbers For A Linear Equation With A Negative Constant","abstract":"An r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that every Δ : [1, n] → [0, t − 1] admits a monochromatic solution to L. If no such integer exists, the t-color Rado number for L is infinite. We prove the following two theorems.","abstract_html":"An r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that every Δ : [1, n] → [0, t − 1] admits a monochromatic solution to L. If no such integer exists, the t-color Rado number for L is infinite. We prove the following two theorems.","abstract_has_math":false,"creators":["Bergjord, Rachel"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - Open Access","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Daniel Schaal"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:03:52Z","subjects":["Mathematics"],"languages":[],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/603","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/603","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd2-1592","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Daniel Schaal"]},{"key":"dc:creator","label":"Author","values":["Bergjord, Rachel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-05-02T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2023-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - Open Access"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/603"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["An r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that every Δ : [1, n] → [0, t − 1] admits a monochromatic solution to L. If no such integer exists, the t-color Rado number for L is infinite. We prove the following two theorems."]},{"key":"dc:title","label":"Title","values":["Some 2-Color Rado Numbers For A Linear Equation With A Negative Constant"]}]}],"canonical_facts":{"dc:contributor":["Daniel Schaal"],"dc:creator":["Bergjord, Rachel"],"dc:date.available":["2023-05-02T07:00:00Z"],"dc:date.created":["2023-01-01T08:00:00Z"],"dc:description.abstract":["An r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that every Δ : [1, n] → [0, t − 1] admits a monochromatic solution to L. If no such integer exists, the t-color Rado number for L is infinite. We prove the following two theorems."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/603"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Mathematics"],"dc:title":["Some 2-Color Rado Numbers For A Linear Equation With A Negative Constant"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis - Open Access"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:03:52Z"}