This paper has been inspired by the endeavour of a large number of mathematicians to discover a Fibonacci-Wieferich prime. An exhaustive computer search has not been successful up to the present even though there exists a conjecture that there are infinitely many such primes. This conjecture is based on the assumption that the probability that a prime $p$ is Fibonacci-Wieferich is equal to $1/p$. According to our computational results and some theoretical consideratons, another form of probability can...

We examine an arithmetical function defined by recursion relations on the sequence ${\left\{f\left(p^k\right)\right\}}_{k\in \mathbb{N}}$ and obtain sufficient condition(s) for the sequence to change sign infinitely often. As an application we give criteria for infinitely many sign changes of Chebyshev polynomials and that of sequence formed by the Fourier coefficients of a cusp form.

Consider the system $x^2-a{y}^2=b$, $P(x,y)=z^2$, where $P$ is a given integer polynomial. Historically, the integer solutions of such systems have been investigated by many authors using the congruence arguments and the quadratic reciprocity. In this paper, we use Kedlaya’s procedure and the techniques of using congruence arguments with the quadratic reciprocity to investigate the solutions of the Diophantine equation $7X^2+Y^7=Z^2$ if $(X,Y)=(L_n,F_n)$ (or $(X,Y)=(F_n,L_n)$) where $\left\{F_n\right\}$ and $\left\{L_n\right\}$ represent the sequences of Fibonacci numbers and Lucas numbers respectively....

We obtain solutions to some conjectures about the nonlinear difference equation $$x_{n+1}=\alpha +\beta x_{n-1}{\mathrm{e}}^{-x_n},n=0,1,\cdots ,\alpha ,\beta >0.$$ More precisely, we get not only a condition under which the equilibrium point of the above equation is globally asymptotically stable but also a condition under which the above equation has a unique positive cycle of prime period two. We also prove some further results.

We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.

Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let p > 3 be a prime. We show that $T_{p-1}\equiv (p/3)3^{p-1}\left(modp²\right)$, where the central trinomial coefficient Tₙ is the constant term in the expansion of $(1+x+x^{-1})ⁿ$. We also prove three congruences modulo p³ conjectured by Sun, one of which is ${\sum }_{k=0}^{p-1}\left(\genfrac{}{}{0pt}{}{p-1}{k}\right)\left(\genfrac{}{}{0pt}{}{2k}{k}\right)({(-1)}^k-{(-3)}^{-k})\equiv (p/3)(3^{p-1}-1)\left(modp³\right)$. In addition, we get some new combinatorial identities.

Melham discovered the Fibonacci identity $F_{n+1}{F}_{n+2}{F}_{n+6}-F{³}_{n+3}=(-1)ⁿFₙ$. He then considered the generalized sequence Wₙ where W₀ = a, W₁ = b, and $Wₙ=p{W}_{n-1}+q{W}_{n-2}$ and a, b, p and q are integers and q ≠ 0. Letting e = pab - qa² - b², he proved the following identity: $W_{n+1}{W}_{n+2}{W}_{n+6}-W{³}_{n+3}=e{q}^{n+1}(p³W_{n+2}-q²W_{n+1})$. There are similar differences of products of Fibonacci numbers, like this one discovered by Fairgrieve and Gould: $FₙF_{n+4}{F}_{n+5}-F{³}_{n+3}={(-1)}^{n+1}{F}_{n+6}$. We prove similar identities. For example, a generalization of Fairgrieve and Gould’s identity is $WₙW_{n+4}{W}_{n+5}-W{³}_{n+3}=eqⁿ(p³W_{n+4}-q{W}_{n+5})$.

In this paper we consider two parameters generalization of the Fibonacci numbers and Pell numbers, named as the $(k,p)$-Fibonacci numbers. We give some new interpretations of these numbers. Moreover using these interpretations we prove some identities for the $(k,p)$-Fibonacci numbers.