In this paper,we consider infinite sums derived from the reciprocals of the square of the Pell numbers.Then applying the floor function to the reciprocals of this sums,we obtain a new and interesting identity involvin...In this paper,we consider infinite sums derived from the reciprocals of the square of the Pell numbers.Then applying the floor function to the reciprocals of this sums,we obtain a new and interesting identity involving the Pell numbers.展开更多
In this paper,we find all positive squarefree integers d satisfying that the Pell equation X^2-d Y^2=±1 has at least two positive integer solutions(X,Y)and(X′,Y′)such that both X and X′have Zeckendorf represen...In this paper,we find all positive squarefree integers d satisfying that the Pell equation X^2-d Y^2=±1 has at least two positive integer solutions(X,Y)and(X′,Y′)such that both X and X′have Zeckendorf representations with at most two terms.展开更多
In this paper we present combinatorial interpretations and polynomials generalizations for sequences including the Fibonacci numbers, the Pell numbers and the Jacobsthal numbers in terms of partitions. It is important...In this paper we present combinatorial interpretations and polynomials generalizations for sequences including the Fibonacci numbers, the Pell numbers and the Jacobsthal numbers in terms of partitions. It is important to mention that results of this nature were given by Santos and Ivkovic in two papers published on the Fibonacci Quarterly, Polynomial generalizations of the Pell sequence and the Fibonacci sequence [1] and Fibonacci Numbers and Partitions [2] , and one, by Santos, on Discrete Mathematics, On the Combinatorics of Polynomial generalizations of Rogers-Ramanujan Type Identities [3]. By these results one can see that from the q-series identities important combinatorial information can be obtained by a careful study of the two variable function introduced by Andrews in Combinatorics and Ramanujan's lost notebook [4].展开更多
The demand for data security schemes has increased with the significant advancement in the field of computation and communication networks.We propose a novel three-step text encryption scheme that has provable securit...The demand for data security schemes has increased with the significant advancement in the field of computation and communication networks.We propose a novel three-step text encryption scheme that has provable security against computation attacks such as key attack and statistical attack.The proposed scheme is based on the Pell sequence and elliptic curves,where at the first step the plain text is diffused to get a meaningless plain text by applying a cyclic shift on the symbol set.In the second step,we hide the elements of the diffused plain text from the attackers.For this purpose,we use the Pell sequence,a weight function,and a binary sequence to encode each element of the diffused plain text into real numbers.The encoded diffused plain text is then confused by generating permutations over elliptic curves in the third step.We show that the proposed scheme has provable security against key sensitivity attack and statistical attacks.Furthermore,the proposed scheme is secure against key spacing attack,ciphertext only attack,and known-plaintext attack.Compared to some of the existing text encryption schemes,the proposed scheme is highly secure against modern cryptanalysis.展开更多
文摘In this paper,we consider infinite sums derived from the reciprocals of the square of the Pell numbers.Then applying the floor function to the reciprocals of this sums,we obtain a new and interesting identity involving the Pell numbers.
基金supported by the project from Universidad del Valle(Grant No.71079)supported by NRF of South Africa(Grant No.CPRR160325161141)an A-Rated Scientist Award from the NRF of South Africa and by Czech Granting Agency(Grant No.17-02804S)。
文摘In this paper,we find all positive squarefree integers d satisfying that the Pell equation X^2-d Y^2=±1 has at least two positive integer solutions(X,Y)and(X′,Y′)such that both X and X′have Zeckendorf representations with at most two terms.
基金Partially supported by FAPESP(Fundacao de Amparo a Pesquisa do Estado de Sao Paulo).
文摘In this paper we present combinatorial interpretations and polynomials generalizations for sequences including the Fibonacci numbers, the Pell numbers and the Jacobsthal numbers in terms of partitions. It is important to mention that results of this nature were given by Santos and Ivkovic in two papers published on the Fibonacci Quarterly, Polynomial generalizations of the Pell sequence and the Fibonacci sequence [1] and Fibonacci Numbers and Partitions [2] , and one, by Santos, on Discrete Mathematics, On the Combinatorics of Polynomial generalizations of Rogers-Ramanujan Type Identities [3]. By these results one can see that from the q-series identities important combinatorial information can be obtained by a careful study of the two variable function introduced by Andrews in Combinatorics and Ramanujan's lost notebook [4].
基金This research is funded through JSPS KAKENHI Grant Number 18J23484,QAU-URF 2015HEC project NRPU-7433.
文摘The demand for data security schemes has increased with the significant advancement in the field of computation and communication networks.We propose a novel three-step text encryption scheme that has provable security against computation attacks such as key attack and statistical attack.The proposed scheme is based on the Pell sequence and elliptic curves,where at the first step the plain text is diffused to get a meaningless plain text by applying a cyclic shift on the symbol set.In the second step,we hide the elements of the diffused plain text from the attackers.For this purpose,we use the Pell sequence,a weight function,and a binary sequence to encode each element of the diffused plain text into real numbers.The encoded diffused plain text is then confused by generating permutations over elliptic curves in the third step.We show that the proposed scheme has provable security against key sensitivity attack and statistical attacks.Furthermore,the proposed scheme is secure against key spacing attack,ciphertext only attack,and known-plaintext attack.Compared to some of the existing text encryption schemes,the proposed scheme is highly secure against modern cryptanalysis.
