On a logarithmic equation by primes

From MaRDI portal
Publication:2080469




Abstract: Let [,cdot,] be the floor function. In this paper we show that every sufficiently large positive integer N can be represented in the form �egin{equation*} N=[p_1log p_1]+[p_2log p_2]+[p_3log p_3], end{equation*} where p1,,p2,,p3 are prime numbers. We also establish an asymptotic formula for the number of such representations, when p1,,p2,,p3 do not exceed given sufficiently large positive number.









This page was built for publication: On a logarithmic equation by primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2080469)