A special sequence and primorial numbers
From MaRDI portal
Publication:6425577
arXiv2302.02838MaRDI QIDQ6425577FDOQ6425577
Eugen J. Ionascu, Amit Kumar Basistha
Publication date: 6 February 2023
Abstract: In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products of infinitely many cycles that depend on certain breaks in the natural numbers that involve the primes and some special products of primes that have a density of approximately 29.4%. We give proofs to some of the claims about these breaking points.
This page was built for publication: A special sequence and primorial numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425577)
