Faster algorithms for Frobenius numbers.
Faster and faster convergent series for .
Fast-Primzahlen in kurzen Intervallen.
Fastpythagoräische Quadrupel.
Fermat and Wilson quotients for -adic integers
Fermat -Fibonacci and -Lucas numbers
Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all -Fibonacci and -Lucas numbers which are Fermat numbers. Some more general results are given.
Fermat numbers and integers of the form
Fermat numbers in the Pascal triangle.
Fermat quotient of cyclotomic units
Fermat test with Gaussian base and Gaussian pseudoprimes
The structure of the group and Fermat’s little theorem are the basis for some of the best-known primality testing algorithms. Many related concepts arise: Euler’s totient function and Carmichael’s lambda function, Fermat pseudoprimes, Carmichael and cyclic numbers, Lehmer’s totient problem, Giuga’s conjecture, etc. In this paper, we present and study analogues to some of the previous concepts arising when we consider the underlying group . In particular, we characterize Gaussian Carmichael numbers...
Fermatquadrupel.
Fermat's equation for matrices or quaternions over q-adic fields
Fermat's Equation in Matrices
The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.
Fermat's last theorem - a topological verification
Fermat's last theorem : récent developments.
Fermat’s Little Theorem via Divisibility of Newton’s Binomial
Solving equations in integers is an important part of the number theory [29]. In many cases it can be conducted by the factorization of equation’s elements, such as the Newton’s binomial. The article introduces several simple formulas, which may facilitate this process. Some of them are taken from relevant books [28], [14]. In the second section of the article, Fermat’s Little Theorem is proved in a classical way, on the basis of divisibility of Newton’s binomial. Although slightly redundant in...
Fermat's theorem for matrices revisited
Fermat's theorem in János Bolyai's manuscripts.
F-Expansions of rationals.
FFF. Fibonacci: di Fiore in Fiore
In occasione della commemorazione dell’800-esimo anniversario della pubblicazione del Liber Abaci, desidero richiamare l’attenzione del lettore su alcuni dei fatti che preferisco riguardanti numeri di Fibonacci. Tali fatti includono la presenza di quadrati, di multipli di quadrati e di numeri potenti tra i numeri di Fibonacci, la rappresentazione di numeri reali e la costruzione di numeri trascendenti mediante numeri di Fibonacci, la possibilità di costruire una serie zeta ed un dominio a fattorizzazione...