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.     

On a variance associated with the distribution of primes in arithmetic progressions

As is usual in prime number theory, write It is well known that when q is close to x the averagevalue of is about xlog q,and recently Friedlander and Goldston have shown that if then the first moment of V(x,q)-U(x,q)is small. In this memoir it is shown that the same is true forall moments. 2000 Mathematics Subject Classification: 11N13.     

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.     

Almost Squares in Arithmetic Progression

It is proved that a product of four or more terms of positive integers in arithmetic progression with common difference a prime power is never a square. More general results are given which completely solve (1.1) with gcd(n, d)=1, k3 and 1<d104.     

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.     

A “Generalized Trace Formula” for Bell numbers

The nth Bell number B_n is the number of ways to partition a set of n elements into nonempty subsets. We generalize the “trace formula” of Barsky and Benzaghou [1], which asserts that for an odd prime p and an appropriate constant τ_p, the relation B_n=-Tr(^n-1-τ_p)B_τp holds in , where is a root of and is the trace form. We deduce some new interesting congruences for the Bell numbers, generalizing miscellaneous well-known results including those of Radoux [4].     

探索以(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).     

Forbidden arithmetic progressions in permutations of subsets of the integers

Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in Davis et al. (1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of $\frac{1}{2}$ on the lower density of subsets of positive integers that can be permuted to avoid arithmetic progressions of length 4, sharpening the lower bound of $\frac{1}{3}$ from LeSaulnier and Vijay (2011).     

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

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

关于高阶Euler数的同余

给出了高阶Euler数的一些同余式.     

Borwein's conjecture on average over arithmetic progressions

We provide asymptotic formulas for sums over arithmetic progressions of coefficients of products of the form