The Titchmarsh problem with integers having a given number of prime divisors (Q1358522)

From MaRDI portal
Revision as of 04:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The Titchmarsh problem with integers having a given number of prime divisors
scientific article

    Statements

    The Titchmarsh problem with integers having a given number of prime divisors (English)
    0 references
    0 references
    14 July 1997
    0 references
    The aim of this paper is to find asymptotic expansions as \(N\) for the number of solutions of the equation \(n+xy= N\), where \(x\), \(y\) are natural numbers and \(n\) is a natural number with exactly \(k\) prime divisors. It is assumed that \(k\) can vary with \(N\). The results obtained are uniform with respect to \(k\leq (2-\varepsilon)\log\log N\) and \((2+\varepsilon)\log\log N\leq k\leq b\log\log N\), where \(\varepsilon>0\).
    0 references
    0 references
    Titchmarsh problem with integers having a given number of prime divisors
    0 references
    divisor function
    0 references
    asymptotic expansions
    0 references