Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-23T12:29:37.708Z Has data issue: false hasContentIssue false
  • English
  • Français

The integer points close to a curve

Published online by Cambridge University Press:  26 February 2010

M. N. Huxley
M. N. Huxley
Affiliation:
School of Mathematics, University of Wales College Cardiff, Senghenydd Road, Cardiff, CF2 4AG.
Get access

Extract

§1. Introduction. In this paper, as in [4], we are concerned with integer points (m, n) lying close to the curve

in the sense that

where ║t║ denotes the distance of the real number t from the nearest integer. We shall always suppose that

and that F(x) is at least twice continuously differentiable. Let R be the number of solutions of (1.1) with m an integer, O ≤ m ≤ L. The obvious method of estimating R uses the row-of-teeth or rounding error function

with

Type
Research Article
Information
Mathematika , Volume 36 , Issue 2 , December 1989 , pp. 198 - 215
Copyright
Copyright © University College London 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Filaseta, M.. An elementary approach to short interval results for fe-free numbers. J. Number Theory, 30 (1988), 208–225.CrossRefGoogle Scholar
2.Graham, S. W. and Kolesnik, G.. Van der Corput's Method for Exponential Sums, London Math. Soc. Lecture Notes. To appear.Google Scholar
3.Huxley, M. N.. Exponential sums and lattice points. To appear in Proc. London Math. Soc.Google Scholar
4.Huxley, M. N.. The fractional parts of a smooth sequence. Mathematika, 35 (1988), 292–296.CrossRefGoogle Scholar
5.Huxley, M. N.. Exponential sums and rounding error. To appear.Google Scholar
6.Swinnerton-Dyer, H. P. F.. The number of lattice points on a convex curve. j Number Theory, 6 (1974), 128–135.CrossRefGoogle Scholar