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.

 

Some computational results on a problem concerning powerful numbers
HTML articles powered by AMS MathViewer

by A. J. Stephens and H. C. Williams PDF
Math. Comp. 50 (1988), 619-632 Request permission

Abstract:

Let D be a positive square-free integer and let $X + Y\sqrt D$ be the fundamental unit in the order with Z-basis $\{ 1,\sqrt D \}$. An algorithm, which is of time complexity $O({D^{1/4 + \varepsilon }})$ for any positive $\varepsilon$, is developed for determining whether or not $D|Y$. Results are presented for a computer run of this algorithm on all $D < {10^8}$. The conjecture of Ankeny, Artin and Chowla is verified for all primes $\equiv 1 \pmod 4$ less than ${10^9}$.
References
Similar Articles
Additional Information
  • © Copyright 1988 American Mathematical Society
  • Journal: Math. Comp. 50 (1988), 619-632
  • MSC: Primary 11R11; Secondary 11A51, 11R27, 11Y16, 11Y40
  • DOI: https://doi.org/10.1090/S0025-5718-1988-0929558-3
  • MathSciNet review: 929558