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).
| Identifer | oai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-8262 |
| Date | 01 August 2018 |
| Creators | Farrugia, James A. |
| Publisher | DigitalCommons@USU |
| Source Sets | Utah State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | All Graduate Theses and Dissertations |
| Rights | Copyright for this work is held by the author. Transmission or reproduction of materials protected by copyright beyond that allowed by fair use requires the written permission of the copyright owners. Works not in the public domain cannot be commercially exploited without permission of the copyright owner. Responsibility for any use rests exclusively with the user. For more information contact digitalcommons@usu.edu. |
Page generated in 0.0015 seconds