By studying the properties of Chebyshev polynomials, some specific and mean-ingful identities for the calculation of square of Chebyshev polynomials, Fibonacci numbersand Lucas numbers are obtained.
Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is ...Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed.展开更多
Let us define to be a r-Toeplitz matrix. The entries in the first row of are or;where F<sub>n</sub> and L<sub>n</sub> denote the usual Fibonacci and Lucas numbers, respe...Let us define to be a r-Toeplitz matrix. The entries in the first row of are or;where F<sub>n</sub> and L<sub>n</sub> denote the usual Fibonacci and Lucas numbers, respectively. We obtained some bounds for the spectral norm of these matrices.展开更多
The purpose of this article is to provide the inversion relationships between the reciprocal sum S（1, 2,…, m） and the alternating sum T（1, 2,…, m） for generalized Lucas numbers which generalizes the Melham＇s re...The purpose of this article is to provide the inversion relationships between the reciprocal sum S（1, 2,…, m） and the alternating sum T（1, 2,…, m） for generalized Lucas numbers which generalizes the Melham＇s results.展开更多
Let us define A=Hr=(aij)?to be n×n?r-Hankel matrix. The entries of matrix A are Fn=Fi+j-2?or Ln=Fi+j-2?where Fn?and Ln?denote the usual Fibonacci and Lucas numbers, respectively. Then, we obtained upper and l...Let us define A=Hr=(aij)?to be n×n?r-Hankel matrix. The entries of matrix A are Fn=Fi+j-2?or Ln=Fi+j-2?where Fn?and Ln?denote the usual Fibonacci and Lucas numbers, respectively. Then, we obtained upper and lower bounds for the spectral norm of matrix A. We compared our bounds with exact value of matrix A’s spectral norm. These kinds of matrices have connections with signal and image processing, time series analysis and many other problems.展开更多
The purpose of this paper is to give the extensions of some identities involving generalized Fibonacci and Lucas numbers with binomial coefficients.These results generalize the identities by Gulec,Taskara and Uslu in ...The purpose of this paper is to give the extensions of some identities involving generalized Fibonacci and Lucas numbers with binomial coefficients.These results generalize the identities by Gulec,Taskara and Uslu in Appl.Math.Lett.23(2010)68-72 and Appl.Math.Comput.220(2013)482-486.展开更多
In this paper, we study the k–Lucas numbers of arithmetic indexes of the form an+r , where n is a natural number and r is less than r. We prove a formula for the sum of these numbers and particularly the sums of the ...In this paper, we study the k–Lucas numbers of arithmetic indexes of the form an+r , where n is a natural number and r is less than r. We prove a formula for the sum of these numbers and particularly the sums of the first k-Lucas numbers, and then for the even and the odd k-Lucas numbers. Later, we find the generating function of these numbers. Below we prove these same formulas for the alternated k-Lucas numbers. Then, we prove a relation between the k–Fibonacci numbers of indexes of the form 2rn and the k–Lucas numbers of indexes multiple of 4. Finally, we find a formula for the sum of the square of the k-Fibonacci even numbers by mean of the k–Lucas numbers.展开更多
ABSTRACT． Led。 be the n^(th) Lucas number， n＞0． Let p be an odd prime． In this paperwe prove a general theorem． According to the theorem we give an algorithm by using whichthe equationl-(n)＝px^(2) can be ...ABSTRACT． Led。 be the n^(th) Lucas number， n＞0． Let p be an odd prime． In this paperwe prove a general theorem． According to the theorem we give an algorithm by using whichthe equationl-(n)＝px^(2) can be solved for arbitrary given p．Por example，we find its all solutionsfor 1000＜p＜40000． By the end of the paper an Interestingconjecture Is presented．展开更多
Let a∈N.In this paper we prove that if Jacobi symbol, then the rsophantine equation y2=ax4 + x3 + 2(a - 1)x= + x + (a - 2) has no integer soutions, except a = ( is a square), x = 2,and a -2 = , x = 0, Whre 2(mod6), Q...Let a∈N.In this paper we prove that if Jacobi symbol, then the rsophantine equation y2=ax4 + x3 + 2(a - 1)x= + x + (a - 2) has no integer soutions, except a = ( is a square), x = 2,and a -2 = , x = 0, Whre 2(mod6), Qk denote Fibonacci-Lucas se-guence defined by Qn+2 = Qn+1 + Qn, Q0 = 2,Q1 =1.展开更多
This paper introduces an improvement to a currently published algorithm to compute both Lucas 'sister' sequences Vk and Uk. The proposed algorithm uses Lucas sequence properties to improve the running time by ...This paper introduces an improvement to a currently published algorithm to compute both Lucas 'sister' sequences Vk and Uk. The proposed algorithm uses Lucas sequence properties to improve the running time by about 20% over the algorithm published in [1].展开更多
In this study, we first give the definitions of (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas sequence. By using these formulas we define (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas matrix sequences. After that we estab...In this study, we first give the definitions of (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas sequence. By using these formulas we define (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas matrix sequences. After that we establish some sum formulas for these matrix sequences.展开更多
基金Supported by the Natural Science Foundation of Shaanxi Province(2002A11)Supported by the Shangluo Teacher's College Research Foundation(SKY2106)
文摘By studying the properties of Chebyshev polynomials, some specific and mean-ingful identities for the calculation of square of Chebyshev polynomials, Fibonacci numbersand Lucas numbers are obtained.
基金Supported by the 973 State Key Project of China (No.G1999035803)the National Natural Science Foundation of China (No.69931010).
文摘Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed.
文摘Let us define to be a r-Toeplitz matrix. The entries in the first row of are or;where F<sub>n</sub> and L<sub>n</sub> denote the usual Fibonacci and Lucas numbers, respectively. We obtained some bounds for the spectral norm of these matrices.
基金Supported by the Natural Science Foundation of the Education Department of Henan Province(2003110009)
文摘The purpose of this article is to provide the inversion relationships between the reciprocal sum S（1, 2,…, m） and the alternating sum T（1, 2,…, m） for generalized Lucas numbers which generalizes the Melham＇s results.
文摘Let us define A=Hr=(aij)?to be n×n?r-Hankel matrix. The entries of matrix A are Fn=Fi+j-2?or Ln=Fi+j-2?where Fn?and Ln?denote the usual Fibonacci and Lucas numbers, respectively. Then, we obtained upper and lower bounds for the spectral norm of matrix A. We compared our bounds with exact value of matrix A’s spectral norm. These kinds of matrices have connections with signal and image processing, time series analysis and many other problems.
基金Supported by the Youth Backbone Teacher Foundation of Henan's University(Grant No.2016GGJS-117)Supported by the National Natural Science Foundation of China(Grant No.11871258)。
文摘The purpose of this paper is to give the extensions of some identities involving generalized Fibonacci and Lucas numbers with binomial coefficients.These results generalize the identities by Gulec,Taskara and Uslu in Appl.Math.Lett.23(2010)68-72 and Appl.Math.Comput.220(2013)482-486.
文摘In this paper, we study the k–Lucas numbers of arithmetic indexes of the form an+r , where n is a natural number and r is less than r. We prove a formula for the sum of these numbers and particularly the sums of the first k-Lucas numbers, and then for the even and the odd k-Lucas numbers. Later, we find the generating function of these numbers. Below we prove these same formulas for the alternated k-Lucas numbers. Then, we prove a relation between the k–Fibonacci numbers of indexes of the form 2rn and the k–Lucas numbers of indexes multiple of 4. Finally, we find a formula for the sum of the square of the k-Fibonacci even numbers by mean of the k–Lucas numbers.
文摘ABSTRACT． Led。 be the n^(th) Lucas number， n＞0． Let p be an odd prime． In this paperwe prove a general theorem． According to the theorem we give an algorithm by using whichthe equationl-(n)＝px^(2) can be solved for arbitrary given p．Por example，we find its all solutionsfor 1000＜p＜40000． By the end of the paper an Interestingconjecture Is presented．
文摘Let a∈N.In this paper we prove that if Jacobi symbol, then the rsophantine equation y2=ax4 + x3 + 2(a - 1)x= + x + (a - 2) has no integer soutions, except a = ( is a square), x = 2,and a -2 = , x = 0, Whre 2(mod6), Qk denote Fibonacci-Lucas se-guence defined by Qn+2 = Qn+1 + Qn, Q0 = 2,Q1 =1.
文摘This paper introduces an improvement to a currently published algorithm to compute both Lucas 'sister' sequences Vk and Uk. The proposed algorithm uses Lucas sequence properties to improve the running time by about 20% over the algorithm published in [1].
文摘In this study, we first give the definitions of (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas sequence. By using these formulas we define (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas matrix sequences. After that we establish some sum formulas for these matrix sequences.
