论文部分内容阅读
<正> Let d3（n） be the number of ways of expressing n as a product of 3 factors. It is known that sum from n≤x d3（n）=xP3（log x）+Δ3（x）, whoro P3 （log x） is g polynomial in log x of degree 2. Let α3 denote the least upper bound of numbers α such that th