{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-2589"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-2589","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Disjunctive Rado numbers for the set of equations ax(,1) + x(,2) = x(,3) and bx(,1) + x(,2) = x(,3)","abstract":"For all integers a and b that satisfy 2 ≤ a ≤ b, let t = rd(S(a), S(b)) be the least integer for S( a) : ax1 + x2 = x3; S(b) : bx1 + x2 = x 3 such that for every coloring Δ : {1, 2, ...t} → {0, 1} there exist integers x1, x 2, and x3 ∈ {1, 2, ...t} such that either ax1 + x 2 = x3 or bx1 + x2 = x3 and Δ( x1) = Δ(x2) = Δ( x3). This t represents the disjunctive Rado number for the set of equations S(a) and S(b). The following theorem is the main result of the paper. Theorem. Let a, b, and r be integers such that 2 ≤ a ≤ b, r is the remainder when (a + 1)2 is divided by b, and 0 ≤ r < b. The disjunctive Rado number for the equations S(a) : ax1 + x2 = x 3 and S(b) : bx1 + x2 = x3 is[special characters omitted]","abstract_html":"For all integers a and b that satisfy 2 ≤ a ≤ b, let t = rd(S(a), S(b)) be the least integer for S( a) : ax1 + x2 = x3; S(b) : bx1 + x2 = x 3 such that for every coloring Δ : {1, 2, ...t} → {0, 1} there exist integers x1, x 2, and x3 ∈ {1, 2, ...t} such that either ax1 + x 2 = x3 or bx1 + x2 = x3 and Δ( x1) = Δ(x2) = Δ( x3). This t represents the disjunctive Rado number for the set of equations S(a) and S(b). The following theorem is the main result of the paper. Theorem. Let a, b, and r be integers such that 2 ≤ a ≤ b, r is the remainder when (a + 1)2 is divided by b, and 0 ≤ r &lt; b. The disjunctive Rado number for the equations S(a) : ax1 + x2 = x 3 and S(b) : bx1 + x2 = x3 is[special characters omitted]","abstract_has_math":false,"creators":["Lane-Harvard, Liz"],"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":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:05:30Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/1589","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/1589","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-2589","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Lane-Harvard, Liz"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-05-29T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2009-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":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/1589"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["For all integers a and b that satisfy 2 ≤ a ≤ b, let t = rd(S(a), S(b)) be the least integer for S( a) : ax1 + x2 = x3; S(b) : bx1 + x2 = x 3 such that for every coloring Δ : {1, 2, ...t} → {0, 1} there exist integers x1, x 2, and x3 ∈ {1, 2, ...t} such that either ax1 + x 2 = x3 or bx1 + x2 = x3 and Δ( x1) = Δ(x2) = Δ( x3). This t represents the disjunctive Rado number for the set of equations S(a) and S(b). The following theorem is the main result of the paper. Theorem. Let a, b, and r be integers such that 2 ≤ a ≤ b, r is the remainder when (a + 1)2 is divided by b, and 0 ≤ r < b. The disjunctive Rado number for the equations S(a) : ax1 + x2 = x 3 and S(b) : bx1 + x2 = x3 is[special characters omitted]"]},{"key":"dc:title","label":"Title","values":["Disjunctive Rado numbers for the set of equations ax(,1) + x(,2) = x(,3) and bx(,1) + x(,2) = x(,3)"]}]}],"canonical_facts":{"dc:creator":["Lane-Harvard, Liz"],"dc:date.available":["2025-05-29T07:00:00Z"],"dc:date.created":["2009-01-01T08:00:00Z"],"dc:description.abstract":["For all integers a and b that satisfy 2 ≤ a ≤ b, let t = rd(S(a), S(b)) be the least integer for S( a) : ax1 + x2 = x3; S(b) : bx1 + x2 = x 3 such that for every coloring Δ : {1, 2, ...t} → {0, 1} there exist integers x1, x 2, and x3 ∈ {1, 2, ...t} such that either ax1 + x 2 = x3 or bx1 + x2 = x3 and Δ( x1) = Δ(x2) = Δ( x3). This t represents the disjunctive Rado number for the set of equations S(a) and S(b). The following theorem is the main result of the paper. Theorem. Let a, b, and r be integers such that 2 ≤ a ≤ b, r is the remainder when (a + 1)2 is divided by b, and 0 ≤ r < b. The disjunctive Rado number for the equations S(a) : ax1 + x2 = x 3 and S(b) : bx1 + x2 = x3 is[special characters omitted]"],"dc:identifier":["https://openprairie.sdstate.edu/etd2/1589"],"dc:title":["Disjunctive Rado numbers for the set of equations ax(,1) + x(,2) = x(,3) and bx(,1) + x(,2) = x(,3)"],"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:05:30Z"}