Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Goldbach Conjecture"”.
-
On a numerical upper bound for the extended Goldbach conjecture
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 …
-
Some explicit results in analytic number theory
… with improving the upper bound to Mertens’ conjecture, building upon the work of Odlyzko, te Riele, Pintz, Kotnik and Saouter. In Chapter 3 (Results in additive number theory), we consider Goldbach-like problems. In Section 3.1, we prove new results pertaining to a previously known …
-
Brun's 1920 Theorem on Goldbach's Conjecture
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 …
-
Improving and maximal inequalities in discrete harmonic analysis
… similar to those required to prove versions of Goldbach conjectures for Gaussian Primes in arbitrary sectors. Fix an interval $\omega \subset \mathbb{T}$. There is an integer $N_\omega $, depending on $ \lvert \omega \rvert$, so that every odd integer $n$ with $N(n)>N_\omega $ is a sum of three …
-
O conjunto excepcional do problema de Goldbach
Seja E(X) a cardinalidade dos números pares menores ou iguais a X que não podem ser escritos como soma de dois primos. O objetivo central desta dissertação é apresentar uma demonstração de uma estimativa para E(X) dada por Hugh L. Montgomery e Robert C. Vaughan em [22]. Mais precisamente, …