Related papers: Using Fibonacci factors to create Fibonacci pseudo…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Let $\Phi_n(q)$ be the $n$-th cyclotomic polynomial in $q$. Recently, the author and Zudilin provide a creative microscoping method to prove some $q$-supercongruences mainly modulo $\Phi_n(q)^3$ by introducing an additional parameter $a$.…

The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime'' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas…

The problem is analyzed of extrapolating power series, derived for an asymptotically small variable, to the region of finite values of this variable. The consideration is based on the self-similar approximation theory. A new method is…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…

In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$…

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

The natural forms of the Leibniz rule for the $k$th derivative of a product and of Fa\`a di Bruno's formula for the $k$th derivative of a composition involve the differential operator $\partial^k/\partial x_1 ... \partial x_k$ rather than…

We prove a subconvexity bound for the central value L(1/2, chi) of a Dirichlet L-function of a character chi to a prime power modulus q=p^n of the form L(1/2, chi)\ll p^r * q^(theta+epsilon) with a fixed r and theta\approx 0.1645 < 1/6,…

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

We investigate supergroups with Grassmann parameters replaced by odd Clifford parameters. The connection with non-anticommutative supersymmetry is discussed. A Berezin-like calculus for odd Clifford variables is introduced. Fermionic…

It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

Let $\psi_m$ be the smallest strong pseudoprime to the first $m$ prime bases. This value is known for $1 \leq m \leq 11$. We extend this by finding $\psi_{12}$ and $\psi_{13}$. We also present an algorithm to find all integers $n\le B$ that…

Given a pseudo-effective divisor L we construct the diminished ideal of L, a "continuous" extension of the asymptotic multiplier ideal for big divisors to the pseudo-effective boundary. For most pseudo-effective divisors L the multiplier…

We prove that every odd semisimple reducible (2-dimensional) mod l Galois representation arises from a cuspidal eigenform. In addition, we investigate the possible different types (level, weight, character) of such a modular form. When the…