{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-2080"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-2080","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Three-Color Rado Numbers for an Inequality","abstract":"Given a system of linear equations or inequalities, the least integer n, provided that it exists, such that for every t-coloring of the set { 1, 2, ... , n} there exists a monochromatic solution to the system is called the t-color Rado number for the system. If there does not exist a least integer n, then we say that the t-color Rado number for the system is infinite. The two-color Rado number of the inequality x1 + x2 + · · · + Xm-1 < xm, where xi ≠ xj when i ≠ j, has already been determined and published. In addition, the structure of the longest two-coloring that avoids a monochromatic solution to the inequality was determined. In this paper, we will present the three-color Rado number of the same inequality and also the structure of the longest three-coloring that avoids a monochromatic solution to the inequality.","abstract_html":"Given a system of linear equations or inequalities, the least integer n, provided that it exists, such that for every t-coloring of the set { 1, 2, ... , n} there exists a monochromatic solution to the system is called the t-color Rado number for the system. If there does not exist a least integer n, then we say that the t-color Rado number for the system is infinite. The two-color Rado number of the inequality x1 + x2 + · · · + Xm-1 &lt; xm, where xi ≠ xj when i ≠ j, has already been determined and published. In addition, the structure of the longest two-coloring that avoids a monochromatic solution to the inequality was determined. In this paper, we will present the three-color Rado number of the same inequality and also the structure of the longest three-coloring that avoids a monochromatic solution to the inequality.","abstract_has_math":false,"creators":["Johnson, Brenda"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","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:04:32Z","subjects":[],"languages":[],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/1098","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/1098","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-2080","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Daniel Schaal"]},{"key":"dc:creator","label":"Author","values":["Johnson, Brenda"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2024-07-16T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2004-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"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/1098"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Given a system of linear equations or inequalities, the least integer n, provided that it exists, such that for every t-coloring of the set { 1, 2, ... , n} there exists a monochromatic solution to the system is called the t-color Rado number for the system. If there does not exist a least integer n, then we say that the t-color Rado number for the system is infinite. The two-color Rado number of the inequality x1 + x2 + · · · + Xm-1 < xm, where xi ≠ xj when i ≠ j, has already been determined and published. In addition, the structure of the longest two-coloring that avoids a monochromatic solution to the inequality was determined. In this paper, we will present the three-color Rado number of the same inequality and also the structure of the longest three-coloring that avoids a monochromatic solution to the inequality."]},{"key":"dc:title","label":"Title","values":["Three-Color Rado Numbers for an Inequality"]}]}],"canonical_facts":{"dc:contributor":["Daniel Schaal"],"dc:creator":["Johnson, Brenda"],"dc:date.available":["2024-07-16T07:00:00Z"],"dc:date.created":["2004-01-01T08:00:00Z"],"dc:description.abstract":["Given a system of linear equations or inequalities, the least integer n, provided that it exists, such that for every t-coloring of the set { 1, 2, ... , n} there exists a monochromatic solution to the system is called the t-color Rado number for the system. If there does not exist a least integer n, then we say that the t-color Rado number for the system is infinite. The two-color Rado number of the inequality x1 + x2 + · · · + Xm-1 < xm, where xi ≠ xj when i ≠ j, has already been determined and published. In addition, the structure of the longest two-coloring that avoids a monochromatic solution to the inequality was determined. In this paper, we will present the three-color Rado number of the same inequality and also the structure of the longest three-coloring that avoids a monochromatic solution to the inequality."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/1098"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Three-Color Rado Numbers for an Inequality"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:04:32Z"}