{"id":{"repo_id":"ohiolink","oai_identifier":"oai:etd.ohiolink.edu:osu1366202528"},"canonical_url":"https://search.dev.ndltd.org/etd/ohiolink/oai:etd.ohiolink.edu:osu1366202528","repository":{"repo_id":"ohiolink","name":"OhioLINK","base_url":"https://etd.ohiolink.edu/acprod/odb_etd/ws/oai/oai"},"display":{"title":"An Exposition Of Dirichlet’s Theorem","abstract":"Though Euclid probably knew there were infinitely many primes, Euclid was the first to provide a proof of the fact. Since then, mathematicians have asked much more detailed and difficult questions about the location and size of the prime numbers. Arithmetic progressions are very easily described subsets of the integers, yet they are infinite so it might be the case that they contain infinitely many prime numbers. Using Euclid’s original proof of the infiniteness of the primes as a model, we can show some specific arithmetic progressions contain infinitely many primes. The problem is, as the arithmetic progression changes Euclid based proofs become difficult. Our appreciation goes to the french mathematician Johann Dirichlet for describing in general when an arithmetic progression assumes an unbounded number of primes. Dirichlet's theorem tells us \\(\\{a + tk\\}_{k \\geq 1}\\) contains infinitely many primes if \\((a, t) = 1\\). In proving this theorem, Dirichlet appeals not to Euclid's proof of there being infinitely many primes, but rather to a proof given Euler. Euler's proof is based on results from calculus, so it is ultimately through analytic methods that Dirichlet was able to prove the general statement of his theorem. This paper will first present both Euclid and Euler style proofs of specific cases of Dirichlet's theorem. Then using this Euler style proof as a guide we will give a roadmap to the proof of Dirichlet's general theorem. Finally, we will develop the background needed for the general proof and give a rigorous presentation of it.","abstract_html":"Though Euclid probably knew there were infinitely many primes, Euclid was the first to provide a proof of the fact. Since then, mathematicians have asked much more detailed and difficult questions about the location and size of the prime numbers. Arithmetic progressions are very easily described subsets of the integers, yet they are infinite so it might be the case that they contain infinitely many prime numbers. Using Euclid’s original proof of the infiniteness of the primes as a model, we can show some specific arithmetic progressions contain infinitely many primes. The problem is, as the arithmetic progression changes Euclid based proofs become difficult. Our appreciation goes to the french mathematician Johann Dirichlet for describing in general when an arithmetic progression assumes an unbounded number of primes. Dirichlet's theorem tells us \\{a + tk\\}k \\geq 1 contains infinitely many primes if \\((a, t) = 1\\). In proving this theorem, Dirichlet appeals not to Euclid's proof of there being infinitely many primes, but rather to a proof given Euler. Euler's proof is based on results from calculus, so it is ultimately through analytic methods that Dirichlet was able to prove the general statement of his theorem. This paper will first present both Euclid and Euler style proofs of specific cases of Dirichlet's theorem. Then using this Euler style proof as a guide we will give a roadmap to the proof of Dirichlet's general theorem. Finally, we will develop the background needed for the general proof and give a rigorous presentation of it.","abstract_has_math":true,"creators":["Turner, Jacob Oakley"],"institution":"The Ohio State University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Cogdell, James"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-08-08","date_published":"2013-08-08","updated_at":"2026-07-24T03:37:46Z","subjects":["Mathematics"],"languages":["English"],"rights":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1366202528","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Cogdell, James"]},{"key":"dc:creator","label":"Author","values":["Turner, Jacob Oakley"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-08-08"]},{"key":"dc:publisher","label":"Institution","values":["The Ohio State University / OhioLINK"]},{"key":"dc:type","label":"Dc Type","values":["Electronic Thesis or Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["The Ohio State University"]}]},{"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:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://rave.ohiolink.edu/etdc/view?acc_num=osu1366202528"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Though Euclid probably knew there were infinitely many primes, Euclid was the first to provide a proof of the fact. Since then, mathematicians have asked much more detailed and difficult questions about the location and size of the prime numbers. Arithmetic progressions are very easily described subsets of the integers, yet they are infinite so it might be the case that they contain infinitely many prime numbers. Using Euclid’s original proof of the infiniteness of the primes as a model, we can show some specific arithmetic progressions contain infinitely many primes. The problem is, as the arithmetic progression changes Euclid based proofs become difficult. Our appreciation goes to the french mathematician Johann Dirichlet for describing in general when an arithmetic progression assumes an unbounded number of primes. Dirichlet's theorem tells us \\(\\{a + tk\\}_{k \\geq 1}\\) contains infinitely many primes if \\((a, t) = 1\\). In proving this theorem, Dirichlet appeals not to Euclid's proof of there being infinitely many primes, but rather to a proof given Euler. Euler's proof is based on results from calculus, so it is ultimately through analytic methods that Dirichlet was able to prove the general statement of his theorem. This paper will first present both Euclid and Euler style proofs of specific cases of Dirichlet's theorem. Then using this Euler style proof as a guide we will give a roadmap to the proof of Dirichlet's general theorem. Finally, we will develop the background needed for the general proof and give a rigorous presentation of it."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","p.58","328.6 KB"]},{"key":"dc:title","label":"Title","values":["An Exposition Of Dirichlet’s Theorem"]}]}],"canonical_facts":{"dc:contributor":["Cogdell, James"],"dc:creator":["Turner, Jacob Oakley"],"dc:date":["2013-08-08"],"dc:description":["Though Euclid probably knew there were infinitely many primes, Euclid was the first to provide a proof of the fact. Since then, mathematicians have asked much more detailed and difficult questions about the location and size of the prime numbers. Arithmetic progressions are very easily described subsets of the integers, yet they are infinite so it might be the case that they contain infinitely many prime numbers. Using Euclid’s original proof of the infiniteness of the primes as a model, we can show some specific arithmetic progressions contain infinitely many primes. The problem is, as the arithmetic progression changes Euclid based proofs become difficult. Our appreciation goes to the french mathematician Johann Dirichlet for describing in general when an arithmetic progression assumes an unbounded number of primes. Dirichlet's theorem tells us \\(\\{a + tk\\}_{k \\geq 1}\\) contains infinitely many primes if \\((a, t) = 1\\). In proving this theorem, Dirichlet appeals not to Euclid's proof of there being infinitely many primes, but rather to a proof given Euler. Euler's proof is based on results from calculus, so it is ultimately through analytic methods that Dirichlet was able to prove the general statement of his theorem. This paper will first present both Euclid and Euler style proofs of specific cases of Dirichlet's theorem. Then using this Euler style proof as a guide we will give a roadmap to the proof of Dirichlet's general theorem. Finally, we will develop the background needed for the general proof and give a rigorous presentation of it."],"dc:format":["application/pdf","p.58","328.6 KB"],"dc:identifier":["http://rave.ohiolink.edu/etdc/view?acc_num=osu1366202528"],"dc:language":["English"],"dc:publisher":["The Ohio State University / OhioLINK"],"dc:rights":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."],"dc:subject":["Mathematics"],"dc:title":["An Exposition Of Dirichlet’s Theorem"],"dc:type":["Electronic Thesis or Dissertation"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["The Ohio State University"]},"updated_at":"2026-07-24T03:37:46Z"}