Related papers: A Functional Recurrence to obtain the Prime Number…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
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…
With the formula of Gandhi you can determine the on $p_n$ immedately subsequent prime $p_{n+1}$ from the knowledge of the primes $p_1, p_2, ... , p_n$. An elementary proof of its trueness will be detailed shown in this paper. Finally the…
We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.
Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.
We explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…
We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…
We answer a number of questions relating to the pseudo-Smarandache function Z(n). We show that the ratio of consecutive values $Z(n+1)/Z(n)$ and $Z(n-1)/Z(n)$ are unbounded; that $Z(2n)/Z(n)$ is unbounded; that $n/Z(n)$ takes every integer…
In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…
Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…
In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…
In this paper, a new formula for {\pi}^(2)(N) is formulated, it is a function that counts the number of semi-primes not exceeding a given number N. A semi-prime is a natural number that is the product of precisely two prime numbers, the two…
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
A recursive random number generator using prime reciprocals is described.
There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…
Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
In this paper we present the definitions and some properties of several Samrandache Type Functions that are involved in many solved and unsolved problems and conjectures in number theory and recreational mathematics.