Generalizations of the Rowland theorem
Vladimir Shevelev

TL;DR
This paper generalizes Rowland's theorem by providing new equivalent formulations and extends the results to generate primes greater than a fixed prime, broadening the understanding of prime generation.
Contribution
It introduces new formulations of Rowland's theorem enabling generalizations and prime generation beyond a fixed prime.
Findings
New equivalent theorems to Rowland's results
A method to generate primes larger than a given prime
Extended understanding of prime generation mechanisms
Abstract
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematics and Applications · Mathematical Dynamics and Fractals
