{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-1400"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-1400","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Totally Multicolored Rado Numbers For the Equation x_1 + x_2 + x_3 + ... + x_(m−1) = x_m","abstract":"A set is called Totally Multicolored (TMC) if no elements in the set are colored the same. For all natural numbers t, m, let R(t, m) be the least natural number n such that for every t-coloring of the set {1, 2, 3, ..., R(t, m)} there exist a solution set {x_1, x_2, . . ., x_m} to L(m), x_1 + x_2 + x_3 + ... + x_(m−1) = x_m such that x_i does not equal x_j for all i that does not equal j, that avoids being Totally Multicolored. This paper shows a function to find R(t,m) for any t greater than or equal to 1 and m greater than or equal to 3. See the abstract in the text for the function that gives R(t,m).","abstract_html":"A set is called Totally Multicolored (TMC) if no elements in the set are colored the same. For all natural numbers t, m, let R(t, m) be the least natural number n such that for every t-coloring of the set {1, 2, 3, ..., R(t, m)} there exist a solution set {x_1, x_2, . . ., x_m} to L(m), x_1 + x_2 + x_3 + ... + x_(m−1) = x_m such that x_i does not equal x_j for all i that does not equal j, that avoids being Totally Multicolored. This paper shows a function to find R(t,m) for any t greater than or equal to 1 and m greater than or equal to 3. See the abstract in the text for the function that gives R(t,m).","abstract_has_math":false,"creators":["Halverson, Skylar"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - Open Access","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:03:31Z","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/399","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/399","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-1400","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Halverson, Skylar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2022-06-10T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2022-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/399"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A set is called Totally Multicolored (TMC) if no elements in the set are colored the same. For all natural numbers t, m, let R(t, m) be the least natural number n such that for every t-coloring of the set {1, 2, 3, ..., R(t, m)} there exist a solution set {x_1, x_2, . . ., x_m} to L(m), x_1 + x_2 + x_3 + ... + x_(m−1) = x_m such that x_i does not equal x_j for all i that does not equal j, that avoids being Totally Multicolored. This paper shows a function to find R(t,m) for any t greater than or equal to 1 and m greater than or equal to 3. See the abstract in the text for the function that gives R(t,m)."]},{"key":"dc:title","label":"Title","values":["Totally Multicolored Rado Numbers For the Equation x_1 + x_2 + x_3 + ... + x_(m−1) = x_m"]}]}],"canonical_facts":{"dc:creator":["Halverson, Skylar"],"dc:date.available":["2022-06-10T07:00:00Z"],"dc:date.created":["2022-01-01T08:00:00Z"],"dc:description.abstract":["A set is called Totally Multicolored (TMC) if no elements in the set are colored the same. For all natural numbers t, m, let R(t, m) be the least natural number n such that for every t-coloring of the set {1, 2, 3, ..., R(t, m)} there exist a solution set {x_1, x_2, . . ., x_m} to L(m), x_1 + x_2 + x_3 + ... + x_(m−1) = x_m such that x_i does not equal x_j for all i that does not equal j, that avoids being Totally Multicolored. This paper shows a function to find R(t,m) for any t greater than or equal to 1 and m greater than or equal to 3. See the abstract in the text for the function that gives R(t,m)."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/399"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Mathematics"],"dc:title":["Totally Multicolored Rado Numbers For the Equation x_1 + x_2 + x_3 + ... + x_(m−1) = x_m"],"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:31Z"}