On a logarithmic equation by primes

From MaRDI portal
Publication:2080469

DOI10.1007/978-3-030-84122-5_12zbMATH Open1496.11127arXiv1912.03772OpenAlexW2992618978MaRDI QIDQ2080469FDOQ2080469


Authors: Stoyan Ivanov Dimitrov Edit this on Wikidata


Publication date: 7 October 2022

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.


Full work available at URL: https://arxiv.org/abs/1912.03772




Recommendations




Cites Work


Cited In (6)





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)