{"entities":{"Q1881756":{"pageid":1892498,"ns":120,"title":"Item:Q1881756","lastrevid":48360127,"modified":"2026-01-04T11:55:51Z","type":"item","id":"Q1881756","labels":{"en":{"language":"en","value":"On the normal order of \\(\\varphi_{k+1}(n)/\\varphi_k(n)\\), where \\(\\varphi_k\\) is the \\(k\\)-fold iterate of Euler's function"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2108212"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1881756$DADEFC45-8091-4533-AA5E-39FF085824E7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8511992b6ecac82f52b55c54bee6fb6de1b46eeb","datavalue":{"value":{"text":"On the normal order of \\(\\varphi_{k+1}(n)/\\varphi_k(n)\\), where \\(\\varphi_k\\) is the \\(k\\)-fold iterate of Euler's function","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1881756$B327BFA8-82D9-43F9-A4BC-C6D189A0C972","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1388d0d1c8fc6b118834633b2fe4e2bc14362f61","datavalue":{"value":"1072.11069","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1881756$67FC242E-7C1F-4387-824C-3AB005CE70AB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1634c3e35c0ad4a60513ee341eb11233291ca61b","datavalue":{"value":"10.1023/B:LIMA.0000019856.89380.72","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1881756$3D0BD5D4-3179-48EB-9C5F-A866729F6D87","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6eae2a8f4ab11bae8edce7ff6ed79c3ee5c09211","datavalue":{"value":{"entity-type":"item","numeric-id":90731,"id":"Q90731"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1881756$E654453E-B50A-46E4-934D-D85CD13F5589","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c7d89478774456ded62a19904fc3ea510aad4b87","datavalue":{"value":{"time":"+2004-10-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1881756$5577F5FA-B85B-430B-A9DE-7CF6C30CAA89","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"31254b68528c72b3634df6ce9ce5c684da56714f","datavalue":{"value":"Denote by \\(\\varphi_k\\) the \\(k\\)-th iterate of Euler's function \\(\\varphi\\). \\textit{P. Erd\u0151s, A. Granville, C. Pomerance}, and \\textit{C. Spiro} [Analytic Number Theory, Proc. Conf. in Honor of Paul Bateman, Boston 1990, Prog. Math. 85, 165--204 (1990; Zbl 0721.11034)] showed that \\( \\varphi_{k+1}(n)/\\varphi_k(n)\\) has the normal order \\[ w_k(x) =\\prod_{p < (\\log\\log x)^{k+1}} \\left( 1 -{1\\over p} \\right). \\] The authors' aim is to give an asymptotic formula for the number \\[ N_k(Q,x) = \\# \\left\\{ n\\leq x; \\; Q \\nmid \\varphi_{k+1}(n) \\right\\}, \\] and for \\[ N_k(Q_1,\\dots,Q_r,\\, x) = \\# \\{ n \\leq x; \\; \\text{gcd}(Q_j,\\, \\varphi_k(n) ) = 1 \\text{ for } j=1,\\dots,r\\}, \\] where \\(Q_1, \\dots, Q_r\\) are different primes. Using many techniques from analytic number theory (for example, the Brun-Titchmarsh theorem, the Bombieri-Vinogradov prime number theorem, an estimate for large values of certain iterated additive functions due to \\textit{N. L. Bassily, I. K\u00e1tai} and \\textit{M. Wijsmuller} [J. Number Theory 65, 226--239 (1997; Zbl 0878.11036)]), the authors prove: For fixed \\(\\varepsilon\\) and \\(k\\geq 2\\), the asymptotics \\[ N_k(Q,x) = \\rho_k(Q)\\cdot x \\cdot \\left( 1 + O\\left({1 \\over {\\log\\log x}}\\right)\\right) \\] holds in the range \\((\\log\\log x)^{k+\\varepsilon} \\leq Q \\leq (\\log\\log x)^{k+1 - \\varepsilon}\\). Here, \\[ \\rho_k(Q) = \\prod_{p < x, \\, \\kappa_{k+1}(p) \\not= 0} \\left( 1 - {1\\over p}\\right), \\] and the \\(\\kappa's\\) are completely additive functions defined by\\(\\kappa_0(p) = 1\\), if \\(p=Q\\), otherwise \\(=0\\), and \\(\\kappa_{j+1}(p) = \\sum_{q\\in {\\mathcal P},\\, q \\mid (p-1)} \\kappa_j(q)\\). An asymptotic for \\(\\log \\rho_k(Q)\\) also is given. In the range \\(\\log\\log\\log x \\cdot \\log\\log x \\leq Q \\leq (\\log\\log x)^2\\) an asymptotic formula for \\(N_1(Q,x)\\) is given. For \\(Q_1, \\dots, Q_r \\in [ (\\log\\log x)^{k+{1\\over2} +\\varepsilon}, \\, (\\log\\log x)^{k+{1} - \\varepsilon}]\\), \\(k\\geq 2\\), the authors prove \\[ N_k(Q_1,\\dots,Q_r,\\, x) = x \\rho_k(Q_1) \\cdots \\rho_k(Q_r) + \\text{ remainder term}. \\] Finally, if \\(J_x\\) is a sequence of intervals for which \\(\\sigma_k^2(J_x) = \\sum_{Q\\in J_x} \\rho_k^2(Q) \\to \\infty\\), \\[ \\lim_{x\\to\\infty} {1\\over x} \\cdot \\# \\left\\{ n