Regular and oscillatory parts for basic functions of prime numbers. I Regular parts

An invitation to additive prime number theory

The main purpose of this survey is to introduce an inexperienced reader to additive prime number theory and some related branches of analytic number theory. We state the main problems in the field, sketch their history and the basic machinery used to study them, and try to give a representative sample of the directions of current research.

基于密度的结构框架用于素数、素数间隙和欧拉乘积

Density-based structural frameworks for prime numbers, prime gaps, and Euler products

本文提出基于密度的结构框架，用于分析素数、素数间隙和欧拉乘积，揭示了Hardy-Littlewood、Cramer和PNT预测之间的张力，并通过截断欧拉乘积分析ζ函数的临界线与零点分布。

Twenty Digits of Some Integrals of the Prime Zeta Function

The double sum sum_(s >= 1) sum_p 1/(p^s log p^s) = 2.00666645... over the inverse of the product of prime powers p^s and their logarithms, is computed to 24 decimal digits. The sum covers all primes p and all integer exponents s>=1. The calculational strategy is adopted from Cohen's work which basically looks at the fraction as the underivative of the Prime Zeta Function, and then evaluates the integral by numerical methods.

Chiral Prime Concatenations

The notion of chiral prime concatenations is studied as a recursive construction of prime numbers starting from a seed set and with appropriate blocks to define the primality growth, generation by generation, either from the right or from the left. Several basic questions are addressed like whether chiral concatenation is a symmetric process, an endless process, as well as the calculation of largest chiral prime numbers. In particular, the largest left-concatenated prime number is constructed. It is a unique prime number of 24 digits. By introducing anomalous left-concatenations of primes we c…

Prime Graph and Its Structures

We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear inside a prime sum graph as an induced subgraph.

On the nonasymptotic prime number distribution

The objective of this paper is to introduce an approach to the study of the nonasymptotic distribution of prime numbers. The natural numbers are represented by theorem 1 in the matrix form ^2N. The first column of the infinite matrix ^2N starts with the unit and contains all composite numbers in ascending order.The infinite rows of this matrix except for the first elements contain prime numbers only, which are determined by an uniform recurrence law. At least one of the elements of the twin pairs of prime numbers is an element of the second column of the matrix ^2N (theorem 3). The basic infor…

按素数进行微分

Differentiating by prime numbers

本文引入了$p$-导数，并展示了其类似导数按数字作用的几种基本方式。

Hitting a prime in 2.43 dice rolls (on average)

What is the number of rolls of fair 6-sided dice until the first time the total sum of all rolls is a prime? We compute the expectation and the variance of this random variable up to an additive error of less than 10^{-4}. This is a solution to a puzzle suggested by DasGupta (2017) in the Bulletin of the Institute of Mathematical Statistics, where the published solution is incomplete. The proof is simple, combining a basic dynamic programming algorithm with a quick Matlab computation and basic facts about the distribution of primes.

On the supersingular locus of the Shimura variety for $\mathrm{GU}(2,2)$ over a ramified prime

We study the structure of the supersingular locus of the Rapoport--Zink integral model of the Shimura variety for $\mathrm{GU}(2,2)$ over a ramified odd prime with the special maximal parahoric level. We prove that the supersingular locus equals the disjoint union of two basic loci, one of which is contained in the flat locus, and the other is not. We also describe explicitly the structures of basic loci. More precisely, the former one is purely $2$-dimensional, and each irreducible component is birational to the Fermat surface. On the other hand, the latter one is purely $1$-dimensional, and …

某些阿贝尔四簇的基本约化在无穷多个素数处成立

Infinitely many primes of basic reduction for some abelian fourfolds

本文将 Elkies 关于椭圆曲线超奇异约化无穷多素数的结果推广到某些亏格 4 曲线，通过 Deligne–Mostow Shimura 簇的一致化、测地线与二次型表示及 CM 点的等分布，证明其雅可比簇在无穷多个素数处具有基本约化。

A Study of Kummer's Proof of Fermat's Last Theorem for Regular Primes

We study Kummer's approach towards proving the Fermat's last Theorem for regular primes. Some basic algebraic prerequisites are also discussed in this report, and also a brief history of the problem is mentioned. We review among other things the Class number formula, and use this formula to conclude our study.

A kind of dynamic model of prime numbers

A dynamic sieve method is designed according to the basic sieve method. It mainly refers to the symbolic dynamics theory. By this method, we could connect the prime system with familiar 'Logistic Mapping'. An interesting discovery is that the pattern of primes could be depicted by a series of orbits of this mapping. Some heuristic proofs for open problems like twin primes are obtained through this relation. This research gives a new viewpoint for the distribution of prime numbers.

On the Distribution of Integers with Restricted Prime Factors I

Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $π(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in $E_j$ for each $j$. Basic probabilistic heuristics suggest that $x^{-1}π(x;\mathbf{E},\mathbf{k})$, modelled as the distribution function of a random variable, should satisfy a joint Poisson law with parameter vector $(E_0(x),\ldots,E_n(x))$, as $x \rightarrow \infty$. We prove an asymptotic formula for $π(x;\mathbf{E},\mathbf{k})$ which contradicts these heuri…

An operator theoretic approach to the Prime number theorem

In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of operator theory.

Shifts of the prime divisor function of Alladi and Erdős

We introduce a variation on the prime divisor function $B(n)$ of Alladi and Erdős, a close relative of the sum of proper divisors function $s(n)$. After proving some basic properties regarding these functions, we study the dynamics of its iterates and discover behaviour that is reminiscent of aliquot sequences. We prove that no unbounded sequences occur, analogous to the Catalan-Dickson conjecture, and give evidence towards the analogue of the Erdős-Granville-Pomerance-Spiro conjecture on the pre-image of $s(n)$.

奇数秩基本 $\mathrm{GL}_n$ 局部志村塔的 Stein 性

Steinness of the Basic $\mathrm{GL}_n$ Local Shimura Tower in Odd Rank

本文证明奇数秩基本局部志村塔在有限层和任意素数下具有 Stein 性，通过构造全局解析函数并证明其有限性，涵盖 $p=2$。

Close to Uniform Prime Number Generation With Fewer Random Bits

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$, where only $t$ is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.…