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 2024 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.

 

Upper bounds for the prime divisors of Wendt’s determinant
HTML articles powered by AMS MathViewer

by Anastasios Simalarides;
Math. Comp. 71 (2002), 415-427
DOI: https://doi.org/10.1090/S0025-5718-00-01292-8
Published electronically: October 18, 2000

Abstract:

Let $c\geq 2$ be an even integer, $(3,c)=1$. The resultant $W_c$ of the polynomials $t^c-1$ and $(1+t)^c-1$ is known as Wendt’s determinant of order $c$. We prove that among the prime divisors $q$ of $W_c$ only those which divide $2^c-1$ or $L_{c/2}$ can be larger than $\theta ^{c/4}$, where $\theta =2.2487338$ and $L_n$ is the $n$th Lucas number, except when $c=20$ and $q=61$. Using this estimate we derive criteria for the nonsolvability of Fermat’s congruence.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 11C20, 11Y40, 11D79
  • Retrieve articles in all journals with MSC (2000): 11C20, 11Y40, 11D79
Bibliographic Information
  • Anastasios Simalarides
  • Affiliation: T.E.I. of Chalcis, Psahna 34400, Euboea, Greece
  • Received by editor(s): April 13, 1999
  • Received by editor(s) in revised form: February 24, 2000
  • Published electronically: October 18, 2000
  • © Copyright 2000 American Mathematical Society
  • Journal: Math. Comp. 71 (2002), 415-427
  • MSC (2000): Primary 11C20; Secondary 11Y40, 11D79
  • DOI: https://doi.org/10.1090/S0025-5718-00-01292-8
  • MathSciNet review: 1863011