4,933 research outputs found
Lucas' Theorem for Prime Powers
Lucas' theorem on binomial coefficients states that (AB)≡(arbr)⋯(a1b1)(a0b0)(mod p) where p is a prime and A = arpr + ⋯ + a0p + a0, B = brpr + ⋯ + b1p + b0 + are the p-adic expansions of A and B. If s ⩾ 2, it is shown that a similar formula holds modulo ps where the product involves a slightly modified binomial coefficient evaluated on blocks of s digits.
Lucas' theorem: its generalizations, extensions and applications (1878--2014)
In 1878 \'E. Lucas proved a remarkable result which provides a simple way to
compute the binomial coefficient modulo a prime in terms of
the binomial coefficients of the base- digits of and : {\it If is
a prime, and are the
-adic expansions of nonnegative integers and , then
\begin{equation*} {n\choose m}\equiv \prod_{i=0}^{s}{n_i\choose m_i}\pmod{p}.
\end{equation*}}
The above congruence, the so-called {\it Lucas' theorem} (or {\it Theorem of
Lucas}), plays an important role in Number Theory and Combinatorics. In this
article, consisting of six sections, we provide a historical survey of Lucas
type congruences, generalizations of Lucas' theorem modulo prime powers, Lucas
like theorems for some generalized binomial coefficients, and some their
applications.
In Section 1 we present the fundamental congruences modulo a prime including
the famous Lucas' theorem. In Section 2 we mention several known proofs and
some consequences of Lucas' theorem. In Section 3 we present a number of
extensions and variations of Lucas' theorem modulo prime powers. In Section 4
we consider the notions of the Lucas property and the double Lucas property,
where we also present numerous integer sequences satisfying one of these
properties or a certain Lucas type congruence. In Section 5 we collect several
known Lucas type congruences for some generalized binomial coefficients. In
particular, this concerns the Fibonomial coefficients, the Lucas -nomial
coefficients, the Gaussian -nomial coefficients and their generalizations.
Finally, some applications of Lucas' theorem in Number Theory and Combinatorics
are given in Section 6.Comment: 51 pages; survey article on Lucas type congruences closely related to
Lucas' theore
The congruence of Wolstenholme and generalized binomial coefficients related to Lucas sequences
Using generalized binomial coefficients with respect to fundamental Lucas
sequences we establish congruences that generalize the classical congruence of
Wolstenholme and other related stronger congruences.Comment: 23 page
Perfect powers in products of terms of elliptic divisibility sequences
Diophantine problems involving recurrence sequences have a long history and
is an actively studied topic within number theory. In this paper, we connect to
the field by considering the equation \begin{align*} B_mB_{m+d}\dots
B_{m+(k-1)d}=y^\ell \end{align*} in positive integers with
and , where is a fixed integer and
is an elliptic divisibility sequence, an important class
of non-linear recurrences. We prove that the above equation admits only
finitely many solutions. In fact, we present an algorithm to find all possible
solutions, provided that the set of -th powers in is given. (Note
that this set is known to be finite.) We illustrate our method by an example.Comment: To appear in Bulletin of Australian Math Societ
A primality criterion based on a Lucas' congruence
Let be a prime. In 1878 \'{E}. Lucas proved that the congruence holds for any nonnegative integer
. The converse statement was given in Problem 1494 of
{\it Mathematics Magazine} proposed in 1997 by E. Deutsch and I.M. Gessel. In
this note we generalize this converse assertion by the following result: If
and are integers such that for every integer , then is a prime and
is a power of .Comment: 6 page
- …