Skip navigation
Skip navigation

On a numerical upper bound for the extended Goldbach conjecture

Quarel, David

Description

The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let D(N) denote the number of such prime decompositions for an even N. It is known that D(N) can be bounded above by D(N) C N log2 N Y pjN p>2 1 + 1 p ?? 2 Y p>2 1 ?? 1 (p ?? 1)2 = C (N) where C denotes Chen's constant. It is conjectured [20] that C = 2. In 2004,Wu [54] showed that C 7:8209. We attempted to replicate his work in computing Chen's constant, and in doing so we provide...[Show more]

CollectionsOpen Access Theses
Date published: 2016
Type: Thesis (Honours)
URI: http://hdl.handle.net/1885/173607
DOI: 10.25911/5d9efb1b88f6c

Download

File Description SizeFormat Image
Quarel_David.pdf1.19 MBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator