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 18 of 18 for “"Numbers, prime"”.
-
Incompleteness of the Giulietti-Ughi arc for large primes
… the Giulietti-Ughi arc is not complete for large primes. This arc is complete for primes which are congruent to three modulo four and less than thirty one. The cardinality of this arc has the same order as the Lunelli-Sce bound. We use two powerful theorems, one on the classifications of Galois …
-
Approximations for some functions of primes
[Please see thesis for abstract.]
-
Factoring Isogenies in Higher Dimension and Applications
… isogenies typically appear as chains of prime-degree maps. Much<br/>like prime numbers, prime-degree isogenies can be considered “atomic entities”. This<br/>raises a natural question: is it possible to “factor” composite-degree isogenies, and if so,<br/>under what conditions?<br/>We show …
-
The distribution of the classical error terms of prime number theory
[Please see thesis for abstract.]
-
Centralizers of elements of prime order in locally finite simple groups
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2008
-
The correction factor in Artin type problems
… a product expression for the density of primes p for which a given non-zero integer a is a primitive root modulo p. The conjectured density was proved in 1967 by Hooley under the assumption of the Generalized Riemann Hypothesis. In 2014, Lenstra, Moree, and Stevenhagen introduced a method …
-
Perron's formula and resulting explicit bounds on sums
… apply to specific sums that are involved in the Prime Number Theorem. Moreover, they are particularly useful in cases where a variant of the Riemann von-Mangoldt explicit formula is not unconditionally available. We choose to implement our bounds on M(x) =∑n≤x μ(n) and m(x) =∑n≤x μ(n/)n (with …
-
On the quality of the ABC-solutions
… , where rad(|abc|) is the product of distinct prime factors of |abc|. The ABC-conjecture states that given ε > 0 the number of the ABC-solutions (a,b,c) with q(a,b,c) ≥ 1+ε is finite. In this thesis, under the ABC-conjecture, we explore the quality of certain families of the ABC-solutions …
-
Explicit zero density for the Riemann zeta function
[See thesis for abstract]
-
Studying the efficiency of the Frobenius primality test
In mathematics, especially number theory, prime numbers are essential concepts. Prime numbers are used in cryptography as one application. Finding large prime numbers is crucial for cryptographic protocols; to do this, we must be able to tell whether a given number is prime or not. To test whether …
-
A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions
… that J. Elstrodt published in 1998 to prove the Prime Number Theorem for arithmetic progressions. We will review basic results from Dirichlet characters and L-functions. Furthermore, we establish a weak version of the Wiener-Ikehara Tauberian Theorem, which is an essential tool for the proof of …
-
An explicit version of Chebotarev's density theorem
Chebotarev's density theorem generalizes the prime number theorem and Dirichlet's theorem for primes in arithmetic progressions to the setting of number fields. In particular, it asserts that prime ideals are equi-distributed over the conjugacy classes of the Galois group of any given normal …
-
A development of properties of coprime chains
Not available
-
Prouhet-Tarry-Escott problem
The purpose of this research paper is to gain a deeper understanding of a famous unsolved mathematical problem known as the Prouhet-Terry-Escott Problem. The Prouhet-Terry-Escott Problem is a complex problem that still has much to be discovered. This fascinating problem shows up in many areas of …
-
Prouhet-Tarry-Escott problem
The purpose of this research paper is to gain a deeper understanding of a famous unsolved mathematical problem known as the Prouhet-Terry-Escott Problem. The Prouhet-Terry-Escott Problem is a complex problem that still has much to be discovered. This fascinating problem shows up in many areas of …
-
Counting prime polynomials and measuring complexity and similarity of information
This dissertation explores an analogue of the prime number theorem for polynomials over finite fields as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. Specifically, a precise asymptotic expansion for the prime polynomial …