Related papers: A Prime-Representing Constant
Mills showed that there exists a constant $A$ such that $\lfloor{A^{3^n}}\rfloor$ is prime for every positive integer $n$. Kuipers and Ansari generalized this result to $\lfloor{A^{c^n}}\rfloor$ where $c\in\mathbb{R}$ and $c\geq 2.106$. The…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Many integer sequences including the Catalan numbers, Motzkin numbers, and the Apr{\'e}y numbers can be expressed in the form ConstantTermOf$\left[P^nQ\right]$ for Laurent polynomials $P$ and $Q$. These are often called ``constant term…
The paper exploits an isomorphism between the natural numbers N and a space U of periodic sequences of the roots of unity in constructing a recursive procedure for representing and computing the prime numbers. The nth wave number ${\bf…
The article describes prime intervals into the prime factorization of the middle binomial coefficient. Prime factors and prime powers are distributed in layers. Each layer consists of non-repeated prime numbers which are chosen (not…
An elementary method for computing various prime sequences using the sequence of Farey sequences is described.
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…
Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in…
Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…
A recursive random number generator using prime reciprocals is described.
Let $ \lfloor x \rfloor $ denote the integer part of $ x $. In 1947, Mills constructed a real number $ \xi > 1 $ such that $\lfloor \xi^{3^k} \rfloor$ is always a prime number for every positive integer $k$. We define Mills' constant as the…
Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…
For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
We verify that every alternating group of degree at most one quadrillion is invariably generated by an element of prime order together with an element of prime power order.
The prime number graph is the set of points $(n,p_n)$ where $p_n$ denotes the $n^{\rm th}$ prime. Let $L(n)$ be the minimum number of straight line segments needed to cover the first $n$ points in this set. Let $B(n)$ be the largest number…
Wright proved that there exists a number $c$ such that if $g_0 = c$ and $g_{n+1} = 2^{g_n}$, then $\lfloor g_n \rfloor$ is prime for all $n > 0$. Wright gave $c = 1.9287800$ as an example. This value of $c$ produces three primes, $\lfloor…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…