Related papers: Digits of primes
In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…
Given an integer $m \geq 2$ and a sufficiently large $q$, we apply a variant of the Maynard--Tao sieve weight to establish the existence of an arithmetic progression with common difference $q$ for which the $m$-th least prime in such…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
Let $q$ be a sufficiently large integer, and $a_0\in\{0,\dots,q-1\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their base $q$ expansion. Similar results are obtained for values of a polynomial…
The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…
Among other results, we establish, in a quantitative form, that any sufficiently large integer cannot simultaneously be divisible only by very small primes and have very few digits in its Zeckendorf representation.
Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.
Simple divisibility rules are given for the 1st 1000 prime numbers.
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…
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modified von Mangoldt function. The series of non-trivial zeta zeros and prime numbers can be given explicitly by superposition of harmonic waves.…
The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
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…