{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/6591"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/6591","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"On the quality of the ABC-solutions","abstract":"An ABC-solution is a triple (a,b,c) of integers such that gcd(a,b,c) = 1 and a+b = c. The quality of an ABC-solution is defined as q(a,b,c) = max{log |a|, log |b|, log |c|} / log rad(|abc|) , where rad(|abc|) is the product of distinct prime factors of |abc|. The ABC-conjecture states that given ε > 0 the number of the ABC-solutions (a,b,c) with q(a,b,c) ≥ 1+ε is finite. In this thesis, under the ABC-conjecture, we explore the quality of certain families of the ABC-solutions formed by terms in Lucas and associated Lucas sequences. We also unconditionally introduce a new family of ABC-solutions with quality > 1. In addition, we provide an upper bound on the quality of the ABC-solutions assuming an explicit version of the ABC-conjecture proposed by Alan Baker. Assuming this explicit upper bound for the quality, we explore the solutions to two Diophantine equations in integers, namely xn+yn = n!zn and n!+1 = m2. Next, inspired by the work of Pink and Szikszai, we provide the solutions to a generalization of n!+1 = m2 in Lucas sequences. Furthermore, we study the S-unit equations and find all the ABC-solutions with rad(ABC) = 30. Lastly, we consider another explicit version of the ABC-conjecture proposed by Baker and show that this conjecture is false by examining the newfound good ABC-solutions.","abstract_html":"An ABC-solution is a triple (a,b,c) of integers such that gcd(a,b,c) = 1 and a+b = c. The quality of an ABC-solution is defined as q(a,b,c) = max{log |a|, log |b|, log |c|} / log rad(|abc|) , where rad(|abc|) is the product of distinct prime factors of |abc|. The ABC-conjecture states that given ε &gt; 0 the number of the ABC-solutions (a,b,c) with q(a,b,c) ≥ 1+ε is finite. In this thesis, under the ABC-conjecture, we explore the quality of certain families of the ABC-solutions formed by terms in Lucas and associated Lucas sequences. We also unconditionally introduce a new family of ABC-solutions with quality &gt; 1. In addition, we provide an upper bound on the quality of the ABC-solutions assuming an explicit version of the ABC-conjecture proposed by Alan Baker. Assuming this explicit upper bound for the quality, we explore the solutions to two Diophantine equations in integers, namely xn+yn = n!zn and n!+1 = m2. Next, inspired by the work of Pink and Szikszai, we provide the solutions to a generalization of n!+1 = m2 in Lucas sequences. Furthermore, we study the S-unit equations and find all the ABC-solutions with rad(ABC) = 30. Lastly, we consider another explicit version of the ABC-conjecture proposed by Baker and show that this conjecture is false by examining the newfound good ABC-solutions.","abstract_has_math":false,"creators":["Bolvardizadeh, Solaleh","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Akbary, Amir"],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023","date_published":"2023","updated_at":"2026-11-19T05:21:46Z","subjects":["ABC-conjecture","ABC-solutions","Lucas sequences","Diophantine equations","triple of integers","Number theory","Lucas numbers","Mathematics","Numbers, Prime","Algebra","Dissertations, Academic"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/6591","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/6591","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F6591","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Akbary, Amir"]},{"key":"dc:creator","label":"Author","values":["Bolvardizadeh, Solaleh","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-09-28T15:44:45Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-09-28T15:44:45Z"]},{"key":"dc:date.issued","label":"Date","values":["2023"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["ABC-conjecture","ABC-solutions","Lucas sequences","Diophantine equations","triple of integers"]},{"key":"dc:subject.lcsh","label":"Dc Subject Lcsh","values":["Number theory","Lucas numbers","Diophantine equations","Mathematics","Numbers, Prime","Algebra","Dissertations, Academic"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights.proquest","label":"Dc Rights Proquest","values":["No"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/6591"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["An ABC-solution is a triple (a,b,c) of integers such that gcd(a,b,c) = 1 and a+b = c. The quality of an ABC-solution is defined as q(a,b,c) = max{log |a|, log |b|, log |c|} / log rad(|abc|) , where rad(|abc|) is the product of distinct prime factors of |abc|. The ABC-conjecture states that given ε > 0 the number of the ABC-solutions (a,b,c) with q(a,b,c) ≥ 1+ε is finite. In this thesis, under the ABC-conjecture, we explore the quality of certain families of the ABC-solutions formed by terms in Lucas and associated Lucas sequences. We also unconditionally introduce a new family of ABC-solutions with quality > 1. In addition, we provide an upper bound on the quality of the ABC-solutions assuming an explicit version of the ABC-conjecture proposed by Alan Baker. Assuming this explicit upper bound for the quality, we explore the solutions to two Diophantine equations in integers, namely xn+yn = n!zn and n!+1 = m2. Next, inspired by the work of Pink and Szikszai, we provide the solutions to a generalization of n!+1 = m2 in Lucas sequences. Furthermore, we study the S-unit equations and find all the ABC-solutions with rad(ABC) = 30. Lastly, we consider another explicit version of the ABC-conjecture proposed by Baker and show that this conjecture is false by examining the newfound good ABC-solutions."]},{"key":"dc:title","label":"Title","values":["On the quality of the ABC-solutions"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Akbary, Amir"],"dc:creator":["Bolvardizadeh, Solaleh","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2023-09-28T15:44:45Z"],"dc:date.available":["2023-09-28T15:44:45Z"],"dc:date.issued":["2023"],"dc:description.abstract":["An ABC-solution is a triple (a,b,c) of integers such that gcd(a,b,c) = 1 and a+b = c. The quality of an ABC-solution is defined as q(a,b,c) = max{log |a|, log |b|, log |c|} / log rad(|abc|) , where rad(|abc|) is the product of distinct prime factors of |abc|. The ABC-conjecture states that given ε > 0 the number of the ABC-solutions (a,b,c) with q(a,b,c) ≥ 1+ε is finite. In this thesis, under the ABC-conjecture, we explore the quality of certain families of the ABC-solutions formed by terms in Lucas and associated Lucas sequences. We also unconditionally introduce a new family of ABC-solutions with quality > 1. In addition, we provide an upper bound on the quality of the ABC-solutions assuming an explicit version of the ABC-conjecture proposed by Alan Baker. Assuming this explicit upper bound for the quality, we explore the solutions to two Diophantine equations in integers, namely xn+yn = n!zn and n!+1 = m2. Next, inspired by the work of Pink and Szikszai, we provide the solutions to a generalization of n!+1 = m2 in Lucas sequences. Furthermore, we study the S-unit equations and find all the ABC-solutions with rad(ABC) = 30. Lastly, we consider another explicit version of the ABC-conjecture proposed by Baker and show that this conjecture is false by examining the newfound good ABC-solutions."],"dc:identifier.uri":["https://hdl.handle.net/10133/6591"],"dc:language.iso":["en"],"dc:publisher":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:publisher.faculty":["Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:rights.proquest":["No"],"dc:subject":["ABC-conjecture","ABC-solutions","Lucas sequences","Diophantine equations","triple of integers"],"dc:subject.lcsh":["Number theory","Lucas numbers","Diophantine equations","Mathematics","Numbers, Prime","Algebra","Dissertations, Academic"],"dc:title":["On the quality of the ABC-solutions"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-19T05:21:46Z"}