Related papers: The twin prime conjecture
Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…
The quantitative distribution of twin primes remains a central open problem in number theory. This paper develops a heuristic model grounded in the principles of sieve theory, with the goal of constructing an analytical approximation for…
In this paper, we survey some recent results on the Artin conjecture and discuss some aspects for the Artin conjecture.
In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.
While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…
These are lecture notes written at the University of Zurich during spring 2014 and spring 2015. The first part of the notes gives an introduction to probability theory. It explains the notion of random events and random variables,…
In this paper, we prove the twin prime conjecture showing that \begin{align} \sum \limits_{\substack{p\leq x\\p,p+2\in \mathbb{P}}}1\geq (1+o(1))\frac{x}{2\mathcal{C}\log^2 x}\nonumber \end{align} where $\mathcal{C}:=\mathcal{C}(2)>0$ fixed…
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
This article covers three topics. (1) It establishes links between the density of certain subsets of the set of primes and related subsets of the set of natural numbers. (2) It extends previous results on a conjecture of Bruinier and Kohnen…
In this short paper, following the most recent advances in complex network theory, a new approach to number theory with potential applications to other fields is proposed. The model by Garcia-Perez, Serrano and Boguna, introduces an…
One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…
A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…
A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for…
The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…
We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…
We continue our recent work on averages for ternary additive problems with powers of prime numbers.
This paper updates the explicit interval estimate for primes between consecutive powers. It is shown that there is least one prime between $n^{155}$ and $(n+1)^{155}$ for all $n\geq 1$. This result is in part obtained with a new explicit…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.