Back to search

Hosted by Utah State University Libraries

Brun's 1920 Theorem on Goldbach's Conjecture

Abstract

dc:description.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).

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Farrugia, James A.
Contributors dc:contributor
  • David E. Brown
  • James S. Cangelosi
  • Dariusz M. Wilczynski

Subjects

dc:subject × 4

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Farrugia, James A.. Brun's 1920 Theorem on Goldbach's Conjecture. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/7153