Ruslan Skuratovskii
Kiev, MAUP, Faculty of Computer Sciences, Ukraine
*Corresponding author: Ruslan Skuratovskii
Email: ruslan@unicyb.kiev.ua, ruslcomp@mail.ru
Abstract
We propose a lower bound for computing quantity of the inverses of Euler’s function. We answer the question about the multiplicity of m in the equation φ(x) = m [5]. An analytic expression for exact multiplicity of m = 22n + a, where a ∈ N , a < 2n, φ(t) = 22n + a was obtained. A lower bound of inverses number for arbitrary m was found. We make an approach to Sierpinski assertion from new side. New numerical metric was proposed.
References
[1] Křížek, M., Luca, F., & Somer, L. (2001). 17 lectures on Fermat numbers: from number theory to geometry. Springer.
[2] Coleman, R. (2009). On the image of euler's totient function. Mathematics.
[3] Ruslan Skuratovskii (2018). The investigation of Euler’s totient function preim-ages. In Sixth International Conference on Analytic Number Theory and Spatial Tessellations. Voronoy Conference (pp. 37-39)
[4] Skuratovskii, R. (2017). INVOLUTIVE IRREDUCIBLE GENERATING SETS AND STRUCTURE OF SYLOW 2-SUBGROUPS OF ALTERNATING GROUPS. Romai journal, 13(1).
[5] Ford, K. (1999). The number of solutions of φ (x) = m. Annals of Mathematics, 150(1), 283-311.
[6] Vinogradov, I. M. (2016). Elements of number theory. Courier Dover Publications.
[7] Skuratovskii, R. V. (2017). Structure and minimal generating sets of Sylow 2-subgroups of alternating groups. Source: https://arxiv.org/abs/1702.05784 v2.
[8] Bakhtiari, M., & Maarof, M. A. (2012). Serious security weakness in RSA cryptosystem. International Journal of Computer Science Issues (IJCSI), 9(1), 175.
[9] Alekseyev, M. A. (2016). Computing the inverses, their power sums, and extrema for Euler’s totient and other multiplicative functions. Journal of Integer Sequences, 19(2), 3.
How to cite this paper
The Investigation of Euler's Totient Function Preimages
How to cite this paper: Ruslan Skuratovskii. (2019) The Investigation of Euler's Totient Function Preimages. J ournal o f Ap plied Mathematics and Computation, 3(3), 591-598.
DOI: 10.26855/jamc.2019.03.001