Related papers: Pisot Numbers and Primes
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
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…
Let $\beta >1$ be an integer or generally a Pisot number. Put $T(x) = \{ \beta x \}$ on $[0,1]$ and let $S: [0,1]\to [0,1]$ be a piecewise linear transformation whose slopes have the form $\pm \beta^m$ with positive integers $m$. We give…
We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…
We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…
We parameterize solutions to the equality $\Phi_3(x)=\Phi_3(a_1)\Phi_3(a_2)\cdots\Phi_3(a_n)$ when each $\Phi_3(a_i)$ is prime. Our focus is on the special cases when $n=2,3,4$, as this analysis simplifies and extends bounds on the total…
A new set of formulas for primes is presented. These formulas are more efficient and grow much slower than the two known formulas of Mills and Wright. 3 new formulas are explained.
We arrive at some new relations for the prime number $P_n$, based on the logarithmic and absolute-value properties of the function $\pi(x)$.
The article focuses on the problems of prime gaps and zero spacings. Possible solutions of several related problems such as the greatest lower bound, the least upper bound of the zero spacings, and the least upper bound of the prime gaps…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…
While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…