Global ETD Search

1	A HISTORY OF THE PRIME NUMBER THEOREM Alexander, Anita Nicole 24 November 2014 (has links) No description available. Mathematics Prime Number Theorem
2	The Riemann Hypothesis and the Distribution of Primes Appelgren, David, Tikkanen, Leo January 2023 (has links) The aim of this thesis is to examine the connection between the Riemannhypothesis and the distribution of prime numbers. We first derive theanalytic continuation of the zeta function and prove some of its propertiesusing a functional equation. Results from complex analysis such asJensen’s formula and Hadamard factorization are introduced to facilitatea deeper investigation of the zeros of the zeta function. Subsequently, therelation between these zeros and the asymptotic distribution of primesis rendered explicit: they determine the error term when the prime-counting function π(x) is approximated by the logarithmic integral li(x).We show that this absolute error is O(x exp(−c√log x) ) and that the Riemannhypothesis implies the significantly improved upper bound O(√x log x). Riemann Riemann Hypothesis Zeta Function Prime Number Theorem Mathematics Matematik
3	A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions Vlasic, Andrew 05 1900 (has links) We follow a research paper 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 our main result. Numbers, Prime. Prime Number Theorem
4	Η συνάρτηση Γάμμα και η συνάρτηση Ζήτα του Riemann Γιαννακούλιας, Άγγελος 14 February 2012 (has links) Η παρούσα διπλωματική εργασία έχει στόχο τη μελέτη της συνάρτησης Ζήτα του Riemann μέσω της Μιγαδικής ανάλυσης δηλαδή ως μία επέκταση αυτής από την ευθεία των πραγματικών αριθμών στο μιγαδικό επίπεδο. Η σύνδεση της συνάρτησης αυτής με τους πρώτους αριθμούς, η διάσημη υπόθεση Riemann, η συναρτησιακή εξίσωση, η αναλυτικότητά της εκτός σημείου είναι μερικά αποτελέσματα της μελέτης. Το αρχικό βήμα της εργασίας πριν από την μελέτη της συνάρτησης Ζήτα είναι μια εκτενής αναφορά στην συνάρτηση Γάμμα ως επεκτεινόμενη στο Μιγαδικό επίπεδο, την αναλυτικότητά της και κάποιων βασικών ιδιοτήτων της. Κάτι τέτοιο ήταν αναγκαίο, διότι η συνάρτηση Γάμμα αποτελεί ένα εργαλείο για τη μελέτη της συνάρτησης Ζήτα. / -- Συνάρτηση Γάμμα Συνάρτηση Ζήτα 512.73 Gamma function Z function The prime number theorem
5	On the Number of Integers Expressible as the Sum of Two Squares Richardson, Robert January 2009 (has links) No description available. Mathematics sum of two squares prime number theorem generalized Wiener-Ikehara theorem Landau
6	Exploring the Riemann Hypothesis Henderson, Cory 28 June 2013 (has links) No description available. Mathematics Riemann hypothesis Riemann zeta function Riemann, Bernhard Riemann Gauss Prime Number Theorem prime numbers prime counting function
7	Fórmulas explícitas em teoria analítica de números / Explicit formula in analytic theory of numbers Castro, Danilo Elias 10 October 2012 (has links) Em Teoria Analítica de Números, a expressão \"Fórmula Explícita\" se refere a uma igualdade entre, por um lado, uma soma de alguma função aritmética feita sobre todos os primos e, por outro lado, uma soma envol- vendo os zeros não triviais da função zeta de Riemann. Essa igualdade não é habitual em Teoria Analítica de Números, que trata principalmente de aproximações assintóticas de funções aritméticas e não de fórmulas exatas. A expressão se originou do trabalho seminal de Riemann, de 1859, onde aparece uma expressão exata para a função (x), que conta o número de primos que não excedem x. A prova do Teorema dos Números Primos, de Hadamard, também se baseia numa fórmula explícita de (x) (função de Tschebycheff). Mais recentemente, o trabalho de André Weil reforçou o inte- resse em compreender-se melhor a natureza de tais fórmulas. Neste trabalho, apresentaremos a fórmula explícita de Riemann-von Mangoldt, a de Delsarte e um caso particular da fórmula explícita de Weil. / In the field of Analytic Theory of Numbers, the expression \"Explicit For- mula\" refers to an equality between, on one hand, the sum of some arithmetic function over all primes and, on the other, a sum over the non-trivial zeros of Riemann s zeta function. This equality is not common in the analytic theory of numbers, that deals mainly with asymptotic approximations of arithmetic functions, and not of exact formulas. The expression originated of Riemann s seminal work, of 1859, in which we see an exact expression for the function (x), that counts the number of primes that do not exceed x. The proof of the Prime Number Theorem, by Hadamard, is also based on an explicit formula of (x) (Tschebycheff s function). More recently, the work of André Weil increased the interest in better comprehending the nature of such formulas. In this work, we shall present the Riemann-von Mangoldt formula, Delsarte s explicit formula, and one particular case of Weil s explicit formula. Analytic theory of numbers Explicit formula Fórmulas explícitas Função zeta de Riemann Hipótese de Riemann Prime number theorem Riemann's hypothesis Riemann's zeta function Teorema dos números primos Teoria analítica dos números
8	On the Theory of Zeta-functions and L-functions Awan, Almuatazbellah 01 January 2015 (has links) In this thesis we provide a body of knowledge that concerns Riemann zeta-function and its generalizations in a cohesive manner. In particular, we have studied and mentioned some recent results regarding Hurwitz and Lerch functions, as well as Dirichlet's L-function. We have also investigated some fundamental concepts related to these functions and their universality properties. In addition, we also discuss different formulations and approaches to the proof of the Prime Number Theorem and the Riemann Hypothesis. These two topics constitute the main theme of this thesis. For the Prime Number Theorem, we provide a thorough discussion that compares and contrasts Norbert Wiener's proof with that of Newman's short proof. We have also related them to Hadamard's and de la Vallee Poussin's original proofs written in 1896. As far as the Riemann Hypothesis is concerned, we discuss some recent results related to equivalent formulations of the Riemann Hypothesis as well as the Generalized Riemann Hypothesis. Riemann zeta function hurwtiz zeta function l functions dedekind zeta function universality prime number theorem riemann hypothesis generalized riemann hypothesis analytic number theory special functions Mathematics
9	Counting prime polynomials and measuring complexity and similarity of information Rebenich, Niko 02 May 2016 (has links) 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 counting function is derived. The approximation given is more accurate than previous results in the literature while requiring very little computational effort. In this context asymptotic series expansions for Lerch transcendent, Eulerian polynomials, truncated polylogarithm, and polylogarithms of negative integer order are also provided. The expansion formulas developed are general and have applications in numerous areas other than the enumeration of prime polynomials. A bijection between the equivalence classes of aperiodic necklaces and monic prime polynomials is utilized to derive an asymptotic bound on the maximal T-complexity value of a string. Furthermore, the statistical behaviour of uniform random sequences that are factored via the T-transform are investigated, and an accurate probabilistic model for short necklace factors is presented. Finally, a T-complexity based conditional string complexity measure is proposed and used to define the normalized T-complexity distance that measures similarity between strings. The T-complexity distance is proven to not be a metric. However, the measure can be computed in linear time and space making it a suitable choice for large data sets. / Graduate / 0544 0984 0405 / nrebenich@gmail.com prime numbers prime polynomials finite fields irreducible polynomials polylogarithm Lerch transcendent Eulerian polynomials T-codes NCD necklaces string complexity information distance divergent series asymptotic approximation randomess test conditional complexity necklace factorization prime number theorem combinatorics T-complexity data mining optimal truncation function fields lyndon words lyndon factorization similarity measure asymptotic enumeration

Search results