Divisor concepts for mosaics of integers
In 1964, \textit{A. A. Mullin} [Z. Math. Logik Grundl. Math. 10, 159--161 (1964; Zbl 0163.03904); ibid. 11, 117--119 (1965; Zbl 0254.10008)] introduced the concept of the ``mosaic of an integer, as follows. The mosaic of the integer \(n\) is the array of prime numbers resulting from iterating the Fundamental Theorem of Arithmetics on \(n\) and on any resulting composite exponents. For example, the mosaic of the integer \(1 024 000 000 = 2^{16}.5^6\) is \(2^{2^{2^2}}.5^{2.3}\). He defined some operations over mosaics of integers and studied their properties. In the present paper, the authors generalize several number-theoretic functions so to be applied for mosaics of integers, and study their properties. The research is illustrated with suitable examples.
This page was built for publication: Divisor concepts for mosaics of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390631)
