【摘要】 <正> 令 d_k(n)记将 n 表成 k 个因子之积的表法的数目.则有渐近公式于此,P_k(In x)为 In x 之一(k—1)次多项式,为(?)在极点s=1号的残数,而对某一α成立.设 k 固定,令 α_k 为使上式成立之 α 的下确界,则有更多还原

【Abstract】 Let d_k,（n）denote the number of ways of expressing n as a product of kfactors.It is known that（?）where P_k0（In x）is a polynomial in lnx of degree k—1,and（?）holds for some a<1.Let a_k denote the least upper bound of numbers a suchthat,the above relation holds.Voronoi and Hardy-Littlewood proved respec-tively（?）for k=2,3,….For k=3,the previous results was pushed forward toa₃≤43/87,a₃≤37/75by Walfisz and Atkinson.The aim of this note is to improve the previousresults toa₃≤14/29.更多还原