{"entities":{"Q1109069":{"pageid":1119818,"ns":120,"title":"Item:Q1109069","lastrevid":66687726,"modified":"2026-04-12T11:59:09Z","type":"item","id":"Q1109069","labels":{"en":{"language":"en","value":"On the number of prime factors of an integer"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4068996"}},"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":"Q1109069$803EB12C-F726-476C-B6EA-F6F671219BF4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4bd407e579e1571d73ffc145bca2d2da79344f4d","datavalue":{"value":{"text":"On the number of prime factors of an integer","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1109069$3B6E0165-160B-440E-833A-BD17EEBA3072","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f7d33fac5e59cf35827473466c2ca9c8f23dbbe7","datavalue":{"value":"0655.10036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109069$A52341C4-D870-4D85-9E62-5E5A00C9B916","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3ab02d6f2edd0cddb47b1814297883d9e50f1bac","datavalue":{"value":"10.1215/S0012-7094-88-05620-7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109069$63CB0654-9886-4A3C-9B82-04666848C463","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"00787a2e6e743258f8c8cfa17814e0fc215eb8b7","datavalue":{"value":{"entity-type":"item","numeric-id":788030,"id":"Q788030"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109069$71FE60D3-4AC6-48BD-AC72-50E8D13BB9B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d58e04b4c66877f3bfae3044292ca5113e00a636","datavalue":{"value":{"entity-type":"item","numeric-id":213656,"id":"Q213656"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109069$EE2B211F-8A39-4432-A04F-A37726B61023","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e8d78105b574d85114159aeeb77fd1baaa47af9d","datavalue":{"value":{"entity-type":"item","numeric-id":247488,"id":"Q247488"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109069$D7809295-BE14-4321-9D25-2D53886BC43A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"31a1937240ca4a323604b4728c31d242b5596d7c","datavalue":{"value":{"time":"+1988-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1109069$73F06EE9-4EAD-4703-9FB8-03D385058A02","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c0de6336441b2801932443c49fdb05b5c000afb3","datavalue":{"value":"The authors prove the remarkable asymptotic formula \\[ (1)\\quad \\pi (x,k)=\\frac{\\rho^{-k} x^{\\alpha} F(\\rho,\\alpha)}{(\\log x) kw(k) w(\\rho)}(1+O(1/L)), \\] which is uniform for \\(x\\geq x_ 0\\), \\(1\\leq k\\ll (\\log x)/(\\log \\log x)^ 2\\), where \\(\\pi\\) (x,k) denotes the number of integers \\(1\\leq n\\leq x\\) which have exactly k distinct prime factors. Further notation in (1) is as follows: \\(F(z,s)=\\prod_{p}(1+z/(p^ s- 1))\\), \\(L=\\log (\\frac{\\log x}{k \\log (k+1)})\\), \\(w(t)=\\Gamma (t)(t/e)^{- t}\\) \\((t>0)\\), \\(\\rho\\) and \\(\\alpha\\) are the (unique) solution of \\[ (2)\\quad \\sum_{p}\\frac{1}{p^{\\alpha}-1+\\rho}=\\frac{k}{\\rho},\\quad \\sum_{p}\\frac{\\rho \\log p}{(1-p^{-\\alpha})(p^{\\alpha}-1+\\rho)}=\\log x, \\] the product and sums being over all primes p. The basic idea of the proof is to use the standard formulae \\[ (3)\\quad \\pi (x,k)=(1/2\\pi i)\\int_{| z| =r}(\\sum_{n\\leq x}z^{\\omega (n)})\\quad z^{-k- 1} dz, \\] \\[ \\sum_{n\\leq x}z^{\\omega (n)}=(1/2\\pi i)\\int^{\\sigma +i\\infty}_{\\sigma -i\\infty}F(z,s)(x^ s/s) ds, \\] where \\(r>0\\), \\(\\sigma >1\\) are parameters to be chosen and \\(\\omega\\) (n) is the number of distinct prime divisors of n. \\textit{A. Selberg} [J. Indian Math. Soc., New Ser. 18, 83-87 (1954; Zbl 0057.285)] chose \\(r=(k-1)/\\log \\log x,\\) \\(\\sigma =2\\) and obtained \\[ (4)\\quad \\pi (x,k)=F(\\frac{k}{\\log \\log x})\\frac{x}{\\log x}\\cdot \\frac{(\\log \\log x)^{k-1}}{(k- 1)!}(1+O(\\frac{1}{\\log \\log x})) \\] (1\\(\\leq k\\leq C \\log \\log x)\\), where \\(C>0\\) is arbitrary but fixed, and \\[ F(z)=\\frac{1}{\\Gamma (z+1)}\\prod_{p}(1+\\frac{z}{p-1})(1-\\frac{1}{p})^ z. \\] In accordance with the ideas used in their important work on integers without large prime factors [Trans. Am. Math. Soc. 296, 265-290 (1986; Zbl 0601.10028)] the authors use the saddle-point technique and choose \\(r=\\rho\\), \\(\\sigma =\\alpha\\) (the solution of (2)). In a series of lemmas they develop the estimates needed to deduce (1) from (3), and in particular they evaluate asymptotically \\(\\rho\\) and \\(\\alpha\\) in Lemma 6. This enables them to recover (4) from (1), and to improve the recent results of \\textit{C. Pomerance} [Number Theory, Proc. 4th Matsci. Conf., Ooatacamund 1984, Lect. Notes Math. 1122, 173-200 (1985; Zbl 0565.10038)] and \\textit{D. Hensley} [Proc. Lond. Math. Soc., III. Ser. 54, 412-444 (1987; Zbl 0588.10047)] on \\(\\pi\\) (x,k), who independently obtained good results in the range \\(k\\gg \\log \\log x.\\) The authors also evaluate the quotients \\(\\pi (x,k+1)/\\pi (x,k)\\) and \\(\\pi\\) (\\(\\lambda\\) x,k)/(\\(\\lambda\\) \\(\\pi\\) (x,k)) uniformly in the range \\(1\\leq \\lambda \\leq x\\), \\(1\\leq k\\ll \\log x/(\\log \\log x)^ 2\\). Thus except in the range \\[ \\log x/(\\log \\log x)^ 2\\quad \\ll \\quad k\\quad \\leq \\quad (1+o(1))\\log x/\\log \\log x \\] the authors successfully solve the problem of the asymptotic formula for \\(\\pi\\) (x,k). It may be mentioned that \\textit{P. Erd\u0151s} and \\textit{J.-L. Nicolas} [Enseign. Math., II. S\u00e9r. 27, 3-27 (1981; Zbl 0466.10037)] showed that the number of \\(n\\leq x\\) for which \\(\\omega (n)>c \\log x/\\log \\log x\\) for \\(0