相关论文: The distribution of the primes
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
A statistical model for the fragmentation of a conserved quantity is analyzed, using the principle of maximum entropy and the theory of partitions. Upper and lower bounds for the restricted partitioning problem are derived and applied to…
Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…
In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…
The prime number 357686312646216567629137 is notable because of the unusual property that it remains prime successively on removing the left digit until there are no remaining digits. We explore here the distributions of the number of left…
We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…
In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken…
Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…
We present a new, elementary, dynamical proof of the prime number theorem.
It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums.…
In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…
In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.