Related papers: Finding Prime Numbers as Fixed Points of Sequences
Let $\psi_m$ be the smallest strong pseudoprime to the first $m$ prime bases. This value is known for $1 \leq m \leq 11$. We extend this by finding $\psi_{12}$ and $\psi_{13}$. We also present an algorithm to find all integers $n\le B$ that…
We introduce an alternative approach for constrained mathematical programming problems. It rests on two main aspects: an efficient way to compute optimal solutions for unconstrained problems, and multipliers regarded as variables for a…
Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…
In 1947 Mills proved that there exists a constant $A$ such that $\lfloor A^{3^n} \rfloor$ is a prime for every positive integer $n$. Determining $A$ requires determining an effective Hoheisel type result on the primes in short intervals -…
The distribution of differences of consecutive members of sequences of primes is investigated. A quantitative measure for oscillations among these differences is the curvature of the sequence. If the sequence is not too sparse, then sharp…
We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$
In this paper, we study power series having a fixed point of multiplier 1. First, we give a closed formula for the residue fixed point index, in terms of the first coefficients of the power series. Then, we use this formula to study wildly…
Let $(a(n) : n \in \mathbb{N})$ denote a sequence of nonnegative integers. Let $0.a(1)a(2)...$ denote the real number obtained by concatenating the digit expansions, in a fixed base, of consecutive entries of $(a(n) : n \in \mathbb{N})$.…
In this paper, we investigate the proportion of monogenic orders among the orders whose indices are a power of a fixed prime in a pure cubic field. We prove that the proportion is zero for a prime number that is not equal to 2 or 3. To do…
As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of…
It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…
The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…
We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…
Prime numbers seem to distribute among the natural numbers with no other law than that of chance, however its global distribution presents a quite remarkable smoothness. Such interplay between randomness and regularity has motivated sci-…
ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…
Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…
A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…
A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…
Let $k\geq 2$ be a fixed natural number. We establish the existence of infinitely many pairs of consecutive primes $p_n$, $p_{n+1}$ satisfying $$ p_{n+1}-p_n\geq c\:\frac{\log p_n\: \log_2 p_n\: \log_4 p_n}{\log_3 p_n}\:,$$ with $c$ being a…
The prime number problem falls within the realm of number theory, specifically elementary number theory. Current research approaches have unnecessarily complicated this matter. In contrast to more advanced mathematical tools, the methods of…