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
Publication date: 7 October 2022
Abstract: Let be the floor function. In this paper we show that every sufficiently large positive integer can be represented in the form �egin{equation*} N=[p_1log p_1]+[p_2log p_2]+[p_3log p_3], end{equation*} where are prime numbers. We also establish an asymptotic formula for the number of such representations, when do not exceed given sufficiently large positive number.
Full work available at URL: https://arxiv.org/abs/1912.03772
Recommendations
Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55)
Cites Work
- Title not available (Why is that?)
- The Hardy-Littlewood method.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distribution of cube-free numbers with form \([n^c]\)
- On an equation with prime numbers
- On an equation with prime numbers
- Title not available (Why is that?)
- On a Diophantine equation involving primes
- On a Diophantine equation with three prime variables
- Goldbach's problem. Selected topics. With forewords by Jörg Brüdern and Preda Mihăilescu
Cited In (6)
- The n -th Prime is Greater than n logn
- A logarithmic inequality involving prime numbers
- The so-called renormalization group method applied to the specific prime numbers logarithmic decrease
- On the almost universality of $\lfloor x^2/a\rfloor +\lfloor y^2/b\rfloor +\lfloor z^2/c\rfloor $
- On a tangent equation by primes
- The logarithm of the least prime factor
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)