Some new Fibonacci and Lucas identities by matrix methods

The aim of this article is to characterize the 2 × 2 matrices X satisfying X ² = X + I and obtain some new identities concerning with Fibonacci and Lucas numbers.     

Proof of three conjectures on congruences

This paper proves three conjectures on congruences involving central binomial coefficients or Lucas sequences.Let p be an odd prime and let a be a positive integer.It is shown that if p=1(mod 4)or a1then where(—)denotes the Jacobi symbol.This confirms a conjecture of the second author.A conjecture of Tauraso is also confirmed by showing that where the Lucas numbers Lo,L_1,L_2,...are defined by L_0=2,L_1=1 and L_n+1=L_n+L_n-l(n=1,2,3,...).The third theorem states that if p=5 then F_p~a-(p~a/5)mod p~3 can be determined in the following way:which appeared as a conjecture in a paper of Sun and Tauraso in 2010.     

搜寻广义Fermat素数

设ｂ为偶数，本文讨论了广义Ｆｅｒｍａｔ数Ｆ（ｂ，ｍ）＝ｂ＾２＋１为素数的必要条件和充分条件，提出了搜寻广义Ｆｅｒｍａｔ素数的一种效率很高的算法并在微机上实现，得出了ｂ≤２５６，ｍ≤１０的全部广义Ｆａｒｍａｔ素数，其中最大的是４６＾２１２＋１。     

探索以(Fn-k,Fn,Fn)为边长的Fibonacci三角形

Fibonacci三角形是边长为Fibonacci数、面积为整数的三角形.存在以(F<,n-k>,F<,n>.F<,n>)为边长的Fibonacci三角形的情形可以被划分为三类(k时,不存在边长为(F<,n-k>,F<,n>.F<,n>)的Fibonacci三角形.     

k=2t·3时不存在以(Fn-k,Fn,Fn)为边长的Fibonacci三角形

Fibonacci三角形是边长为Fibonacci数、面积为整数的三角形.利用平方剩余的方法得到:当k=2'·3时,不存在边长为(Fn-k,Fn,Fn)的Fibonacci三角形(k＜2).     

Fibonacci and Lucas congruences and their applications

In this paper we obtain some new identities containing Fibonacci and Lucas numbers. These identities allow us to give some congruences concerning Fibonacci and Lucas numbers such as L _2mn+k ≡ (−1)^(m+1)n L _k (mod L _m ), F _2mn+k ≡ (−1)^(m+1)n F _k (mod L _m ), L _2mn+k ≡ (−1) ^mn L _k (mod F _m ) and F _2mn+k ≡ (−1) ^mn F _k (mod F _m ). By the achieved identities, divisibility properties of Fibonacci and Lucas numbers are given. Then it is proved that there is no Lucas number L _n such that L _n = L ₂ ^k t L _m x ² for m > 1 and k ≥ 1. Moreover it is proved that L _n = L _m L _r is impossible if m and r are positive integers greater than 1. Also, a conjecture concerning with the subject is given.     

涉及广义Fibonacci-Lucas数的幂的一些级数的近似值

计算出涉及广义Fibonacci-Lucas数的幂的一些级数的近似值。     

关于与广义Fibonacci,Lucas数有关的一些级数的注记

求出了一些与广义Fibonacci,Lucas数有关的一些倒数级数的值。     

关于Lucas三角形猜想的一个结果

运用初等方法,证明k=7时Lucas三角形不存在.     

b≤2000,m≤10的广义Fermat素数

设b为偶数，本文基于作者的原有结果，进一步改进了算法，对于b≤2000,m≤10给出了所有广义Fermat素数F(b,m)=b^2m 1，其中最大的是1632^1024 1,有3290位。     

一些包含Fibonacci-Lucas数的恒等式和同余式

给出了一些包含F ibonacci-Lucas数的恒等式和同余式.     

关于Fibonacci三角形猜想k=6的证明

运用初等方法,证明k=6时Fibonacci三角形不存在.     

关于Lucas数列同余性质的研究

将二项式系数的性质应用到Lucas数列的研究中,并结合Fibonacci数列与Lucas数列的恒等式得到几个有趣的Lucas数列的同余式．     

Some Identities Involving Square of Fibonacci Numbers and Lucas Numbers

By studying the properties of Chebyshev polynomials, some specific and meaningful identities for the calculation of square of Chebyshev polynomials, Fibonacci numbers and Lucas numbers are obtained.