1,720,966 research outputs found
Diophantine Equations Related to Linear Recurrence Sequences
No full textThe aim of this dissertation is to investigate the solutions of some Diophantine equations connected to linear recurrence sequences. We firstly study the integer solutions of Diophantine equations related to reciprocals and repdigits with linear recurrence sequences, respectively. Finally, we present techniques with which we can investigate the nontrivial integer solutions of equations of the form G(X,Y,Z):=AX^2+ BY^r+CZ^2 involving certain binary linear recurrence sequences.L
A New Modification of RSA Cryptosystem Based on The Number of The Private Keys
Get PDFThe need of the privacy for each person has encouraged cryptologists to create and modified cryptosystems. However, the RSA cryptosystem is a secure public key cryptosystem, this paper focuses on modifying RSA cryptosystem by increasing the number of private keys. This modification can be applied over plaintext messages, plain matrices, however in this paper, I focuse on applying it particulary on matrices which are the corresponding matrices of images. A public key and private key are contained in this secure cryptosystem, and the security of its private key depends on the integer factorization problem. But, this only private key might be found by inspection. Therefore, this new modification gives the RSA cryptosystem a higher security, because it suggests a "k" number of distinct private keys. Therefore, this new modification makes the RSA cryptosystem more secure and a confidential public key cryptosystem
Lucas sequences and repdigits
Get PDFsummary:Let be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are and , respectively. We show that the Diophantine equation has only finitely many solutions in , where , is even and . Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral points on such curves, we conclude the finiteness result. In fact, we show this result in detail in the case of , and the remaining case can be handled in a similar way. We apply our result to the sequences of Fibonacci numbers and Pell numbers . Furthermore, with the first application we determine all the solutions of the equation , where and
Solutions of the Diophantine Equation from Recurrence Sequences
Get PDFsummary:Consider the system , , where 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 if (or ) where and represent the sequences of Fibonacci numbers and Lucas numbers respectively
- …
