On Some Generalizations of Fermat's, Lucas's and Wilson's Theorems

Some identities for the generalized Fibonacci polynomials by the Q(x) matrix

In this note, we obtain some identities for the generalized Fibonacci polynomial by using the Q(x) matrix. These identities including the Cassini identity and Honsberger formula can be applied to some polynomial sequences, such as Fibonacci polynomials, Lucas polynomials, Pell polynomials, Pell-Lucas polynomials, Fermat polynomials, Fermat-Lucas polynomials, and so on.

更高素数幂模下的威尔逊定理 I：费马商与威尔逊商

Wilson's theorem modulo higher prime powers I: Fermat and Wilson quotients

该研究利用Bell多项式与Newton恒等式，证明威尔逊定理及威尔逊商可由含费马商幂和项的任意更高素数幂模超同余式描述，还给出相关多元多项式的递推公式与更多性质，推进了数论中超同余问题的研究。

Primality of numbers of the form $ap^{k}+1$

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's converse of Fermat's little theorem. This result was considerably improved by Henry Pocklington in 1914 when he showed that it's not necessary to know all the prime factors of $n-1$ in order to determine if $n$ is prime. In this paper we optimize Pocklington's primality test for integers of the form $ap^{k}+1$ where $p$ is prime, $a<p$, $k\ge 1$. An extensi…

Fermat-Wilson Supercongruences, arithmetic derivatives and strange factorizations

In [Tha15], we looked at two (`multiplicative' and `Carlitz-Drinfeld additive') analogs each, for the well-known basic congruences of Fermat and Wilson, in the case of polynomials over finite fields. When we look at them modulo higher powers of primes, i.e. at `supercongruences', we find interesting relations linking them together, as well as linking them with arithmetic derivatives and zeta values. In the current work, we expand on the first analog and connections with arithmetic derivatives more systematically, giving many more equivalent conditions linking the two, now using `mixed derivati…

Classical and modular approaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers

This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat's Last Theorem. In this paper we give new improved bounds for linear forms in three logarithms. We also apply a combination of classical techniques with the modular approach to show that the only perfect powers in the Fibonacci sequence are 0, 1, 8, 144 and the only perfect powers in the Lucas sequence are 1, 4.

Lerch Quotients, Lerch Primes, Fermat-Wilson Quotients, and the Wieferich-non-Wilson Primes 2, 3, 14771

The Fermat quotient $q_p(a):=(a^{p-1}-1)/p$, for prime $p\nmid a$, and the Wilson quotient $w_p:=((p-1)!+1)/p$ are integers. If $p\mid w_p,$ then $p$ is a Wilson prime. For odd $p,$ Lerch proved that $(\sum_{a=1}^{p-1} q_p(a) - w_p)/p$ is also an integer; we call it the Lerch quotient $\ell_p.$ If $p\mid\ell_p$ we say $p$ is a Lerch prime. A simple Bernoulli-number test for Lerch primes is proven. There are four Lerch primes 3, 103, 839, 2237 up to $3\times10^6$; we relate them to the known Wilson primes 5, 13, 563. Generalizations are suggested. Next, if $p$ is a non-Wilson prime, then $q_p(w…