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 15 of 15 for “"sieve methods"”.
-
Sieve Methods and Some Applications
Sieve methods have long been of value in investigating certain problems in the theory of numbers. The first purpose of this thesis is to present a study of several of the existing sieve methods beginning with the original sieve of Eratosthenes, described in section II, followed by the improved …
-
Sieve Methods and its Application in Probabilistic Galois Theory
… first part of the thesis, we introduce the Large Sieve Method and apply it to solve Probabilistic Galois The- ory problems over rational numbers. We estimate, E_n(B), the number of polynomials of degree n and height at most B whose Galois group is a proper subgroup of the symmetric group Sn. Van …
-
Combinatorial Generalizations of Sieve Methods and Characterizing Hamiltonicity via Induced Subgraphs
A sieve method is in effect an application of the inclusion-exclusion counting principle, and the estimation methods to avoid computing the explicit formula. Sieve methods have been used in number theory for over a hundred years. These methods have been modified to make use of the structure of …
-
Exponential sums, character sums, sieve methods and distribution of prime numbers /
… AUTHOR'S REQUEST.] This thesis is focus on the methods of exponential sums and sieve methods applying to distribution of primes numbers in several forms, such as Piatetski-Shapiro primes, Beatty sequences, almost primes and primes in arithmetic progression. In the end, we also think about the …
-
Application of sieve methods to factorization and the discrete logarithm problem
… Among other material we describe the Quadratic Sieve and the Number Field Sieve as they apply to factoring. We finally sketch how the Number Field Sieve can be applied to compute discrete logarithms.
-
Matematiska såll, primtalstvillingar och Chens sats
… talteori. Med hjälp av Halberstam och Richerts Sieve Methods redogör vi för grundläggande sållteori med fokus på tillämpningar i studiet av primtalstvillingar. Vi bevisar och tillämpar varianter av Eratosthenes-Legendres såll, Bruns såll och Selbergs såll. Vi formulerar också de viktigaste …
-
Explicit Mertens' theorems for number fields
… function that unlocks nice applications in sieve methods, such as bounds on the number of rational primes represented by a polynomial. Therefore, we use Lemma 5.2.1 and Theorem 1.1.3 to establish explicit Nagell theorems in Corollary 5.1.1; these are weighted Mertens' theorems that appear in …
-
The distribution of prime numbers in short intervals
… estimates, their weighted variation, and sieve methods. In Chapter 2, we will provide a generalised version of Ingham's theorem, which connects the classical zero-density estimates with primes in short intervals; our version of the theorem explicitly shows the dependence of a short …
-
Topics in sieve theory
<p>This thesis is concerned with applications of sieve methods to two Diophantine problems.</p> <p>The first problem requires us to prove the existence of a certain infinite configuration of sums of two squares. Namely, the aim is to exhibit two increasing sequences of integers ai and mj such that …
-
On coverings and reduced residues in combinatorial number theory
… factor. However, the until now very promising sieve methods seem to have reached a limit here, and the main goal of this work is to develop other combinatorial methods in hope of coming a bit closer to prove the conjecture of Montgomery. Alongside, we solve a problem of Recamán about the …
-
Problems in Combinatorial and Analytic Number Theory
… depth in the tree. The second problem studies sieve methods in combinatorics. We apply the Turan sieve and the simple sieve developed by Ram Murty and Yu-Ru Liu to study problems in random graph theory. More specifically, we obtain bounds on the probability of a graph having diameter 2 (or …
-
Topics in analytic number theory
… satisfies the Hasse principle. Our proof uses sieve methods.</p> </p>
-
Constructing suitable parameters for pairing-based cryptography
… properties and present a survey of the known methods for their construction. In addition we present an analytic study of our methods and results on constructing pairing-friendly elliptic curves and highlight their importance. One of the most important contribution is that in our examples we …
-
Distribution of integers with prescribed arithmetic structure and applications
This thesis contains results about the distribution of integers with prescribed arithmetic structure and an application. These include a counting problem in Diophantine approximation, an asymptotic formula for the number of solutions to congruence's with certain arithmetic conditions, lower bounds …
-
New Explicit and Asymptotic Results in Sieve Theory
In this thesis, we prove new results in sieve theory --- an active subfield of number theory. Sieve theory constitutes a set of tools that are used to detect integers in sparse sets with a bounded number of prime factors. After giving a short introduction to sieve theory, we prove an explicit form …