You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Upper Bounds for the Prime Divisors of Wendt's Determinant
Mathematics of Computation
Vol. 71, No. 237 (Jan., 2002), pp. 415-427
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2698883
Page Count: 13
You can always find the topics here!Topics: Integers, Prime numbers, Mathematical congruence, Factorization, Polynomials, Resultants, Fermats last theorem, Mathematical tables, Numbers
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Let c ≥ 2 be an even integer, (3, c) = 1. The resultant Wc of the polynomials tc - 1 and (1 + t)c - 1 is known as Wendt's determinant of order c. We prove that among the prime divisors q of Wc only those which divide 2c- 1 or Lc/2 can be larger than θc/4, where θ = 2.2487338 and Ln is the nth Lucas number, except when c = 20 and q = 61. Using this estimate we derive criteria for the nonsolvability of Fermat's congruence.
Mathematics of Computation © 2002 American Mathematical Society