The sum of \(\alpha^{\Omega(n)}\) over integers n\(\leq x\) with all prime factors between \(\alpha\) and y (Q788029): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q180520
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Aleksandar Ivić / rank
 
Normal rank

Revision as of 13:46, 10 February 2024

scientific article
Language Label Description Also known as
English
The sum of \(\alpha^{\Omega(n)}\) over integers n\(\leq x\) with all prime factors between \(\alpha\) and y
scientific article

    Statements

    The sum of \(\alpha^{\Omega(n)}\) over integers n\(\leq x\) with all prime factors between \(\alpha\) and y (English)
    0 references
    0 references
    1984
    0 references
    Estimates of the function \(\psi_{\alpha}(x,y)=\sum \alpha^{\Omega(n)}\), \(\alpha\geq 1\), where the sum is taken over all n, 1\(\leq n\leq x\) such that if p is prime and \(p| n\) then \(\alpha<p\leq y\), are discussed. This function is related to the well known function \(\psi\) (x,y), which represents the number of \(n\leq x\) all of whose prime factors are \(\leq y\). The function by which \(\psi_{\alpha}(x,y)\) is approximated is \(x\rho_{\alpha}(u)\log^{\alpha -1}x\), where \(u=\log x/\log y\) and \(\rho_{\alpha}(u)\) is a solution of a certain differential delay equation. \(\{\) Reviewer's remark: in the definition of \(\rho_{\alpha}\) on p. 207 in ii) one should replace \(<\) by \(=\}\).
    0 references
    Dickman-de Bruijn function
    0 references
    largest prime factor
    0 references
    asymptotic behaviour
    0 references

    Identifiers