Results 131 to 140 of about 537 (169)
Some of the next articles are maybe not open access.
Basic Properties of Fermat Numbers
2002First we present a few recurrence formulae for the Fermat numbers. Most of these can be found in the paper [Grytczuk] (see also [Schram]).
Michal Křížek +2 more
openaire +1 more source
Let us look on Fermat numbers and on numbers linked to Fermat numbers
Theoretical Mathematics & Applications, 2022Ikorong Annouk, Ozen OZER
openaire +1 more source
A primality test for Fermat numbers
1995The paper gives a primality criterion for Fermat numbers \(F_n=2^{2^n}+1\) \(\left(n=0,1,2,\ldots\right)\). The author proves the following theorem. Let \(k\) and \(n\) be fixed positive integers such that \(0< k\leq [\log n/\log_2]\) and \(n>1\). The Fermat number \(F_k\) is prime if and only if \(F_k\) does not divide \(T\left(2^{n-1}\right)\), where
Grytczuk, A., Grytczuk, J.
openaire +2 more sources
Number Theory: Fermat’s Last Theorem
1999On June 24, 1993, the New York Times ran a front-page story with the headline “At Last, Shout of ‘Eureka!’ In Age-Old Math Mystery.” The proverbial shout of “Eureka!” had echoed across the campus of Cambridge University, England, just the day before.
Reinhard Laubenbacher, David Pengelley
openaire +1 more source
Abrasion Resistant/Waterproof Stretchable Triboelectric Yarns Based on Fermat Spirals
Advanced Materials, 2021Chengyi Hou, Yaogang Li, Qinghong Zhang
exaly
Local criteria for the unit equation and the asymptotic Fermat’s Last Theorem
Proceedings of the National Academy of Sciences of the United States of America, 2021Nuno Freitas, Alain Kraus, Samir Siksek
exaly