Date of Award:
8-2018
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Mathematics and Statistics
Committee Chair(s)
David E. Brown
Committee
David E. Brown
Committee
James S. Cangelosi
Committee
Dariusz M. Wilczynski
Abstract
One form of Goldbach’s Conjecture asserts that every even integer greater than 4is the sum of two odd primes. In 1920 Viggo Brun proved that every sufficiently large even number can be written as the sum of two numbers, each having at most nine prime factors. This thesis explains the overarching principles governing the intricate arguments Brun used to prove his result.
Though there do exist accounts of Brun’s methods, those accounts seem to miss the forest for the trees. In contrast, this thesis explains the relatively simple structure underlying Brun’s arguments, deliberately avoiding most of his elaborate machinery and idiosyncratic notation. For further details, the curious reader is referred to Brun’s original paper (in French).
Checksum
4e01eb463709ad277a778fbb4762b761
Recommended Citation
Farrugia, James A., "Brun's 1920 Theorem on Goldbach's Conjecture" (2018). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 7153.
https://digitalcommons.usu.edu/etd/7153
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .