A Functional Recurrence to obtain the Prime Numbers using the Smarandache Prime Function
英文摘要：
In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
The Classical Smarandache Function and a Formula for Twin Primes
This short paper presents an exact formula for counting twin prime pairs less than or equal to x in terms of the classical Smarandache Function. An extension of the formula to count prime pairs (p, p+2n), n > 1, is also given.
math.GM
On solutions of some of unsolved problems in number theory, specifically on the distribution of primes
We solve some famous conjectures on the distribution of primes. These conjectures are to be listed as Legendre's, Andrica's, Oppermann's, Brocard's, Cramér's, Shanks', and five Smarandache's conjectures. We make use of both Firoozbakht's conjecture (which recently proved by the author) and Kourbatov's theorem on the distribution of and gaps between consecutive primes. These latter conjecture and theorem play an essential role in our methods for proving these famous conjectures. In order to prove Shanks' conjecture, we make use of Panaitopol's asymptotic formula for $π(x)$ as well.
math.GM
The recurrence formulas for primes and non-trivial zeros of the Riemann zeta function
In this article, we explore the Riemann zeta function with a perspective on primes and non-trivial zeros. We develop the Golomb's recurrence formula for the $n$th+1 prime, and assuming (RH), we propose an analytical recurrence formula for the $n$th+1 non-trivial zero of the Riemann zeta function. Thus all non-trivial zeros up the $n$th order must be known to generate the $n$th+1 non-trivial zero. We also explore a variation of the recurrence formulas for primes based on the prime zeta function, which will be a basis for the development of the recurrence formulas for non-trivial zeros based on …
math.GM
Recurrence Divisibility Tests
In this note, we are going to introduce some recurrence divisibility tests for all primes except than 2 and 5.
math.GM
Properties and applications of the prime detecting function: infinitude of twin primes, asymptotic law of distribution of prime pairs differing by an even number
The prime detecting function (PDF) approach can be effective instrument in the investigation of numbers. The PDF is constructed by recurrence sequence - each successive prime adds a sieving factor in the form of PDF. With built-in prime sieving features and properties such as simplicity, integro-differentiability and configurable capability for a wide variety of problems, the application of PDF leads to new interesting results. As an example, in this exposition we present proofs of the infinitude of twin primes and the first Hardy-Littlewood conjecture for prime pairs (the twin prime number th…
math.GM
About the logic of the prime number distribution
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 form 6n+1. All existing prime numbers seem to be contained in these two number sequences, except of the prime numbers 2 and 3. Riemanns Zeta Function also seems to indicate, that there is a logical connection between the mentioned number sequences and the distribution of prime numbers. This connection is indicated by lines in the diagram of the Zeta Function, …
math.GM
