Date of Award:

8-2018

Document Type:

Thesis

Degree Name:

Master of Science (MS)

Department:

Mathematics and Statistics

Advisor/Chair:

David E. Brown

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

865e5676f9574e6a1e8c202f11d8fc6c

Included in

Mathematics Commons

Share

COinS