The Titchmarsh problem with integers having a given number of prime divisors (Q1358522): Difference between revisions

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\).