2 citations · 3 across the 3 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2011
On a problem of Dobrowolski--Williams
Dmitriy Frolenkov
In this paper we prove new upper bounds for the sum , for a certain class of arithmetic functions . Our results improve the previous results of G. Bachma…
math.NT2011★ 2 cited
Numerically explicit version of the Pólya--Vinogradov inequality
Dmitriy Frolenkov
In this paper we proved a new numerically explicit version of the Pólya--Vinogradov inequality. Our proof is based on the new ideas of V.A. Bykovskii and improves a recent inequali…
math.NT2011★ 1 cited
The mean value of Frobenius numbers with three arguments
Frolenkov Dmitriy
We prove an asymptotic formula for the mean value of Frobenius numbers with three arguments. To prove this we use a new method invented by A. Ustinov, Rodseth's algorithm an bounds…