ID: math/0412220

An invitation to additive prime number theory

December 10, 2004

View on ArXiv

Similar papers 5

A survey on the theory of multiple Dirichlet series with arithmetical coefficients on the numerators

January 19, 2021

86% Match
Kohji Matsumoto
Number Theory

We survey some recent developments in the analytic theory of multiple Dirichlet series with arithmetical coefficients on the numerators.

Find SimilarView on arXiv

Additive unit representations in global fields - A survey

February 1, 2011

86% Match
Fabrizio Barroero, Christopher Frei, Robert F. Tichy
Number Theory
Rings and Algebras

We give an overview on recent results concerning additive unit representations. Furthermore the solutions of some open questions are included. The central problem is whether and how certain rings are (additively) generated by their units. This has been investigated for several types of rings related to global fields, most importantly rings of algebraic integers. We also state some open problems and conjectures which we consider to be important in this field.

Find SimilarView on arXiv

The prime number theorem through one-sided Tauberian theorems

March 26, 2024

86% Match
Gregory Debruyne
Number Theory

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

Find SimilarView on arXiv

What is the best approach to counting primes?

June 14, 2014

86% Match
Andrew Granville
Number Theory

As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of great mathematics, the techniques and insights permeating many different fields. In this article we will review some of the best techniques for counting primes, centering our discussion around Riemann's seminal paper. We will go on to discuss ...

Find SimilarView on arXiv

Counting Primes Rationally And Irrationally

July 29, 2019

86% Match
N. A. Carella
General Mathematics

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x) \gg \log \log x/\log \log \log x$. This note improves the lower bound to $\pi(x) \gg \log x$, and extends the analysis to the irrationality measures $\mu(\zeta(s)) \geq 1$ for rational ratios of zeta functions.

Find SimilarView on arXiv

Small Doubling and Additive Structure Modulo a Prime

April 14, 2012

86% Match
Øystein J. Rødseth
Combinatorics
Number Theory

This paper has been withdrawn by the author due to an error in the proof of Theorem 6.

Find SimilarView on arXiv

Some remarks in elementary prime number theory

October 31, 2018

86% Match
Raffaele Marcovecchio
Number Theory

We give an outline of a generalization of the Gelfond-Schnirelmann method in elementary number theory. It is related to an integral of Selberg (1944) generalizing the Euler beta integral. The result we explain was obtained by Nair and Chudnovsky independently in the early eighties.

Find SimilarView on arXiv

Harmonic Analysis on the Positive Rationals I: Basic Results

May 28, 2014

86% Match
P. D. T. A. Elliott, Jonathan Kish
Number Theory

This is the first of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression and to the Fourier coefficients of automorphic cusp forms.

Find SimilarView on arXiv

On the Solution of the Equation $n = ak + bp_k$ by Means of an Iterative Method

November 28, 2021

86% Match
Juan Luis Varona
Number Theory
Numerical Analysis
Dynamical Systems
Numerical Analysis

For fixed positive integers $n$, we study the solution of the equation $n = k + p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterative method \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to the solution of the equation, if it exists. We also analyze the equation $n = ak + bp_k$ for fixed integer values $a \ne 0$ and $b>0$, and its solution by means of a corresponding iterative method. The case $a>0$ is somewhat similar to the case $a=b...

Find SimilarView on arXiv

Explicit Estimates in the Theory of Prime Numbers

November 22, 2016

86% Match
Adrian Dudek
Number Theory

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.3))$. To prove this, we first derive an explicit version of the Riemann--von Mangoldt explicit formula. We then assume the Riemann hypothesis and show that there will be a prime in the int...

Find SimilarView on arXiv