English
Related papers

Related papers: Counting Prime $k$-tuples

200 papers

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

Number Theory · Mathematics 2021-06-04 Alessandro Languasco , Alessandro Zaccagnini

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

General Mathematics · Mathematics 2017-11-01 Kevin B. Espinet

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Number Theory · Mathematics 2026-04-28 Terence Tao , Joni Teräväinen

We explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…

Mathematical Physics · Physics 2007-05-23 Lubomir Alexandrov , Lachezar Georgiev

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

General Mathematics · Mathematics 2020-03-24 Yuri Heymann

In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k_{0}, using the values of the zeta function \zeta_{k_{0}} at negative integers as our ``higher…

Number Theory · Mathematics 2025-10-20 Joshua Holden

We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.

Number Theory · Mathematics 2021-12-01 Alexey Orlov

Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - \Delta^{-1}), x]$.

Number Theory · Mathematics 2022-09-15 Michaela Cully-Hugill , Ethan S. Lee

In this paper we consider the functional equation for factorial sum and its particular solutions (Kurepa's function $K(z)$ \cite{Kurepa_71} and function $K_{1}(z)$). We determine an extension of domain of functions $K(z)$ and $K_{1}(z)$ in…

Number Theory · Mathematics 2007-05-23 Branko J. Malesevic

Let $\Lambda\left(n\right)$ be the Von Mangoldt function, let \[ r_{G}\left(n\right)=\underset{{\scriptstyle m_{1}+m_{2}=n}}{\sum_{m_{1},m_{2}\leq n}}\Lambda\left(m_{1}\right)\Lambda\left(m_{2}\right), \] \[…

Number Theory · Mathematics 2018-01-26 Marco Cantarini

Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Number Theory · Mathematics 2022-01-06 Błażej Żmija

A number $n$ is practical if every integer in $[1,n]$ can be expressed as a subset sum of the positive divisors of $n$. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and…

Number Theory · Mathematics 2020-10-27 Carl Pomerance , Andreas Weingartner

Let $\zeta(.)$ denote the Riemann zeta function and let $a(.)$ and $A(.)$ respectively denote a multiplicative function and its corresponding summatory function. We consider the correlation $$ \langle a(n)A(n-1) \rangle (T) =…

Number Theory · Mathematics 2026-05-15 Gordon Chavez

In this work, the commutator of any two reasonable functions of several pairs of canonical conjugate operators is obtained as a sum of terms of partial derivatives of those functions (equations 9, 10 or 11). When applied to quantum…

Mathematical Physics · Physics 2024-07-23 Conrado Badenas

We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that a positive proportion of consecutive primes are within a…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , C. Y. Yildirim

We use multiple zeta functions to prove, under suitable assumptions, precise asymptotic formulas for the averages of multivariable multiplicative functions. As applications, we prove some conjectures on the average number of cyclic…

Number Theory · Mathematics 2021-08-24 D. Essouabri , C. Salinas Zavala , L. Tóth

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

Number Theory · Mathematics 2013-03-19 Michel Planat , Patrick Solé

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

Number Theory · Mathematics 2011-06-15 Aran Nayebi

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

Number Theory · Mathematics 2014-09-11 Olivia Beckwith , Christine Bessenrodt