Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Zaremba’s conjecture and sums of the divisor function
HTML articles powered by AMS MathViewer

by T. W. Cusick PDF
Math. Comp. 61 (1993), 171-176 Request permission

Abstract:

Zaremba conjectured that given any integer $m > 1$, there exists an integer $a < m$ with a relatively prime to m such that the simple continued fraction $[0,{c_1}, \ldots ,{c_r}]$ for a/m has ${c_i} \leq B$ for $i = 1,2 \ldots ,r$, where B is a small absolute constant (say $B = 5$). Zaremba was only able to prove an estimate of the form ${c_i} \leq C\log m$ for an absolute constant C. His first proof only applied to the case where m is a prime; later he gave a very much more complicated proof for the case of composite m. Building upon some earlier work which implies Zaremba’s estimate in the case of prime m, the present paper gives a much simpler proof of the corresponding estimate for composite m.
References
  • T. W. Cusick, Products of simultaneous approximations of rational numbers, Arch. Math. (Basel) 53 (1989), no. 2, 154–158. MR 1004273, DOI 10.1007/BF01198566
  • H. Davenport, On a generalization of Euler’s function $\varphi (n)$, J. London Math. Soc. 7 (1932), 290-296.
  • Hans Günther Kopetzky, Über die Grössenordnung der Teilerfunktion in Restklassen, Monatsh. Math. 82 (1976), no. 4, 287–295. MR 429800, DOI 10.1007/BF01540600
  • D. H. Lehmer, Euler constants for arithmetical progressions, Acta Arith. 27 (1975), 125–142. MR 369233, DOI 10.4064/aa-27-1-125-142
  • S. K. Zaremba, La méthode des “bons treillis” pour le calcul des intégrales multiples, Applications of number theory to numerical analysis (Proc. Sympos., Univ. Montréal, Montreal, Que., 1971) Academic Press, New York, 1972, pp. 39–119 (French, with English summary). MR 0343530
  • S. K. Zaremba, Good lattice points modulo composite numbers, Monatsh. Math. 78 (1974), 446–460. MR 371845, DOI 10.1007/BF01295488
Similar Articles
Additional Information
  • © Copyright 1993 American Mathematical Society
  • Journal: Math. Comp. 61 (1993), 171-176
  • MSC: Primary 11J13; Secondary 11J25, 11J70
  • DOI: https://doi.org/10.1090/S0025-5718-1993-1189517-7
  • MathSciNet review: 1189517