A Note on Cube-Full Numbers in Arithmetic Progression
We obtain an asymptotic formula for the cube-full numbers in an arithmetic progression n≡lmod q, where q,l=1. By extending the construction derived from Dirichlet’s hyperbola method and relying on Kloosterman-type exponential sum method, we improve the very recent error term with x118/4029<q....
Saved in:
Main Authors: | Mingxuan Zhong, Yuankui Ma |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/5552120 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes
by: Shengzhang Ren
Published: (2014-01-01) -
On Reciprocal Series of Generalized Fibonacci Numbers with Subscripts in Arithmetic Progression
by: Neşe Ömür
Published: (2012-01-01) -
Finite and Infinite Arithmetic Progressions Related to Beta-Expansion
by: Bing Li, et al.
Published: (2014-01-01) -
Theory of Arithmetic /
by: Peterson, John A.
Published: (1963) -
CubeSats and Small Satellites
by: Jeremy Straub, et al.
Published: (2019-01-01)