Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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

 
 

 

The prime factors of Wendt's binomial circulant determinant


Authors: Greg Fee and Andrew Granville
Journal: Math. Comp. 57 (1991), 839-848
MSC: Primary 11Y50; Secondary 11C20, 11D41, 11R18, 11Y40
DOI: https://doi.org/10.1090/S0025-5718-1991-1094948-8
MathSciNet review: 1094948
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Wendt's binomial circulant determinant, $ {W_m}$, is the determinant of an m by m circulant matrix of integers, with (i, j)th entry $ \left( {\begin{array}{*{20}{c}} m \\ {\vert i - j\vert} \\ \end{array} } \right)$ whenever 2 divides m but 3 does not. We explain how we found the prime factors of $ {W_m}$ for each even $ m \leq 200$ by implementing a new method for computations in algebraic number fields that uses only modular arithmetic. As a consequence we prove that if p and $ q = mp + 1$ are odd primes, 3 does not divide m, and $ m \leq 200$, then the first case of Fermat's Last Theorem is true for exponent p.


References [Enhancements On Off] (What's this?)

  • [1] D. W. Boyd, The asymptotic behaviour of the binomial circulant determinant, J. Math. Anal. Appl. 86 (1982), 30-38. MR 649851 (83f:10007)
  • [2] B. W. Char, K. O. Geddes, and G. H. Gonnet, GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation, Proc. Internat. Sympos. Symbolic and Algebraic Manipulation (J. Fitch, ed.), Lecture Notes in Comput. Sci., vol. 174, Springer-Verlag, Berlin and New York, 1984, pp. 285-296. MR 779134
  • [3] D. Coppersmith, Fermat's Last Theorem (case I) and the Wieferich criterion, Math. Comp. 54 (1990), 895-902. MR 1010598 (90h:11024)
  • [4] P. Dénes, An extension of Legendre's criterion in connection with the first case of Fermat's Last Theorem, Publ. Math. Debrecen 2 (1951), 115-120. MR 0047068 (13:822h)
  • [5] G. Faltings, Endlichkeitssätze für abelsche Varietäten über Zahlkörpern, Invent. Math. 73 (1983), 349-366. MR 718935 (85g:11026a)
  • [6] J. S. Frame, Factors of the binomial circulant determinant, Fibonacci Quart. 18 (1980), 9-23. MR 570658 (81j:10007)
  • [7] G. Fung, A. Granville, and H. C. Williams, Computations on the first factor of the class number of cyclotomic fields, J. Number Theory (to appear). MR 1189508 (93k:11097)
  • [8] P. Furtwängler, Letzter Fermatscher Satz und Eisensteinsches Reziprozitätsprinzip, Sitzungsber. Akad. Wiss. Wien. Abt. IIa 121 (1912), 589-592.
  • [9] A. Granville, Diophantine equations with varying exponents (with special reference to Fermat's Last Theorem), Doctoral thesis, Queen's University, Kingston, Ontario, 1987.
  • [10] A. Granville and B. Powell, On Sophie Germain type criteria for Fermat's Last Theorem, Acta Arith. 50 (1988), 265-277. MR 960554 (89g:11024)
  • [11] G. H. Hardy and S. Ramanujan, The normal number of prime factors of a number n, Quart. J. Math. 48 (1917), 76-92.
  • [12] M. Krasner, A propos du critère de Sophie Germain-Furtwängler pour le premier cas du théorème de Fermat, Mathematica Cluj 16 (1940), 109-114. MR 0001751 (1:291k)
  • [13] A. M. Legendre, Recherches sur quelques objets d'analyse indéterminée et particulièrement sur le théorème de Fermat, Mém. Acad. Sci. Inst. France 6 (1823), 1-60.
  • [14] M. Morrison and J. Brillhart, A method of factoring and the factorization of F7, Math. Comp. 29 (1975), 183-205. MR 0371800 (51:8017)
  • [15] J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76 (1974), 521-528. MR 0354514 (50:6992)
  • [16] P. Ribenboim, 13 lectures on Fermat's Last Theorem, Springer-Verlag, New York, 1979. MR 551363 (81f:10023)
  • [17] M. A. Stern, Einige Bemerkungen über eine Determinante, J. Reine Angew. Math. 73 (1871), 379-380.
  • [18] J. Tanner and S. S. Wagstaff, Jr., New congruences for the Bernoulli numbers, Math. Comp. 48 (1987), 341-350. MR 866120 (87m:11017)
  • [19] E. Wendt, Arithmetische Studien über den letzten Fermatschen Satz, welcher aussagt, dass die Gleichung $ {a^n} = {b^n} + {c^n}$ für $ n > 2$ in ganzen Zahlen nicht auflösbar ist, J. Reine Angew. Math. 113 (1894), 335-347.
  • [20] A. Wieferich, Zum letzten Fermat'sehen Theorem, J. Reine Angew. Math. 135 (1909), 293-302.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y50, 11C20, 11D41, 11R18, 11Y40

Retrieve articles in all journals with MSC: 11Y50, 11C20, 11D41, 11R18, 11Y40


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1991-1094948-8
Article copyright: © Copyright 1991 American Mathematical Society

American Mathematical Society