相关论文: Consecutive primes which are widely digitally deli…

We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…

A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering…

Recently, I have defined the so called PDF's (prime distribution factors) which govern the distribution of prime numbers of the type $p,p+a_i$ being all primes up to some number $n$. It was shown that the PDF's are expressible in terms of…

Goldston, Pintz and Y\i ld\i r\i m have shown that if the primes have `level of distribution' $\theta$ for some $\theta>1/2$ then there exists a constant $C(\theta)$, such that there are infinitely many integers $n$ for which the interval…

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

For arbitrary positive integers $q_1 \ge q_2 \ge q_3 \ge \cdots$ we construct a family of monomial ideals such that for each positive integer $e$ and for each ideal $I$ in the family, the number of associated primes of $I^e$ is the $q_e$.…

In this paper, we prove a necessary and sufficient condition for the Lucas-Carmichael integers in terms of the sum of base-$p$ digits. We also study some interesting properties of such integers. Finally, we prove that there are infinitely…

A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…

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…

Dirichlet's proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Euler's earlier work on the…

A Toda prime of an integer $n$ is an odd prime $p$ such that $4n=(p-1)k$ with $k$ coprime to $p$. We conjecture that every positive integer admits at least two Toda primes. We give a partial proof that every positive integer admits at least…

In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthenes. For this purpose, the mathematical representation is a uni-dimentional time line depicting the number line for positive natural numbers…

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

An open conjecture of Z.-W. Sun states that for any integer $n>1$ there is a positive integer $k\le n$ such that $\pi(kn)$ is prime, where $\pi(x)$ denotes the number of primes not exceeding $x$. In this paper, we show that for any positive…

A (positive definite and integral) quadratic form is said to be $\textit{prime-universal}$ if it represents all primes. Recently, Doyle and Williams in [2] classified all prime-universal diagonal ternary quadratic forms, and all…

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…

In recent work by Botkin, Dawsey, Hemmer, Just and the present author, a deterministic model of prime number distribution is developed based on properties of integer partitions that gives almost exact estimates for $\pi(n)$, the number of…

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…

This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…