Related papers: Lucas' theorem modulo $p^2$

The Gauss--Lucas theorem states that any convex set $K\subset\mathbb{C}$ which contains all $n$ zeros of a degree $n$ polynomial $p\in\mathbb{C}[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following…

In this paper, we extend the $p$-adic valuations originally obtained by Carmichael for the sequences obtained by applying M\"obius inversion to Lucas sequences to $p$-adic congruences, from which we immediately derive corresponding…

Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…

The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…

The article focuses on three different notions of polynomiality for maps of modules. In addition to the polynomial maps studied by Eilenberg and Mac Lane and the strict polynomial maps ("lois polynomes") considered by Roby, we introduce…

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two…

Deduction modulo is a way to express a theory using computation rules instead of axioms. We present in this paper an extension of deduction modulo, called Polarized deduction modulo, where some rules can only be used at positive…

We establish a weak form of Ennola's conjecture. We achieve this by showing that two main assumptions Louboutin made in his previous work hold true. These assumptions are about Laurent polynomials over the rationals, and we prove them by…

We develop a wide general theory of bilinear bi-parameter singular integrals $T$. First, we prove a dyadic representation theorem starting from $T1$ assumptions and apply it to show many estimates, including $L^p \times L^q \to L^r$…

In this article we present Pickands theorem and his double sum method. We follow Piterbarg's proof of this theorem. Since his proof relies on general lemmas we present a complete proof of Pickands theorem using Borell inequality and Slepian…

We extend the digital binomial identity as given by Nguyen el al. to an identity in an arbitrary base $b$, by introducing the $b-$ary binomial coefficients. We then study the properties of these coefficients such as orthogonality, a link to…

We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any…

In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

It is known that all terms $U_n$ of a classical regular Lucas sequence have a primitive prime divisor if $n>30$. In addition, a complete description of all regular Lucas sequences and their terms $U_n$, $2\leq n\leq 30$, which do not have a…