![]() Firstly, we study several questions concerning the intersection between two classes of non-degenerate binary recurrence sequences and provide, whenever possible, effective bounds on the largest member of this intersection. Various Diophantine problems are investigated and new results are found out of this study. This thesis is about the study of Diophantine equations involving binary recurrent sequences with arithmetic functions.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |