{"title":"Diophantine equation （T_l=\\mathcal {U}_n -\\mathcal {U}_m\\)","authors":"Pagdame Tiebekabe, Kossi Richmond Kakanou, Ismaïla Diouf","doi":"10.1007/s13370-024-01214-4","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we have determined the necessary and sufficient conditions so that Tribonacci numbers can be written as the differences of two elements of generalized Lucas sequences. We have also shown that the number of solutions of the equation in the title is finite. For application, we have determined the Tribonacci numbers written as the difference of two Fibonacci numbers.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"35 4","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Diophantine equation \\\\(T_l=\\\\mathcal {U}_n -\\\\mathcal {U}_m\\\\)\",\"authors\":\"Pagdame Tiebekabe, Kossi Richmond Kakanou, Ismaïla Diouf\",\"doi\":\"10.1007/s13370-024-01214-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we have determined the necessary and sufficient conditions so that Tribonacci numbers can be written as the differences of two elements of generalized Lucas sequences. We have also shown that the number of solutions of the equation in the title is finite. For application, we have determined the Tribonacci numbers written as the difference of two Fibonacci numbers.</p></div>\",\"PeriodicalId\":46107,\"journal\":{\"name\":\"Afrika Matematika\",\"volume\":\"35 4\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Afrika Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s13370-024-01214-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Afrika Matematika","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s13370-024-01214-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
The Diophantine equation \(T_l=\mathcal {U}_n -\mathcal {U}_m\)
In this paper, we have determined the necessary and sufficient conditions so that Tribonacci numbers can be written as the differences of two elements of generalized Lucas sequences. We have also shown that the number of solutions of the equation in the title is finite. For application, we have determined the Tribonacci numbers written as the difference of two Fibonacci numbers.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
