皮莱对斐波那契和帕多万序列的问题

IF 0.3 Q4 MATHEMATICS Annales Mathematicae et Informaticae Pub Date : 2019-01-01 DOI:10.33039/ami.2019.09.001

Ana Cecilia García Lomelí, S. Hernández, F. Luca

{"title":"皮莱对斐波那契和帕多万序列的问题","authors":"Ana Cecilia García Lomelí, S. Hernández, F. Luca","doi":"10.33039/ami.2019.09.001","DOIUrl":null,"url":null,"abstract":"Let ( 𝐹 𝑚 ) 𝑚 > 0 and ( 𝑃 𝑛 ) 𝑛 > 0 be the Fibonacci and Padovan sequences given by the initial conditions 𝐹 0 = 0 , 𝐹 1 = 1 , 𝑃 0 = 0 , 𝑃 1 = 𝑃 2 = 1 and the recurrence formulas 𝐹 𝑚 +2 = 𝐹 𝑚 +1 + 𝐹 𝑚 , 𝑃 𝑛 +3 = 𝑃 𝑛 +1 + 𝑃 𝑛 for all 𝑚, 𝑛 > 0 , respectively. In this note we study and completely solve the Diophantine","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Pillai’s problem with the Fibonacci andPadovan sequences\",\"authors\":\"Ana Cecilia García Lomelí, S. Hernández, F. Luca\",\"doi\":\"10.33039/ami.2019.09.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let ( 𝐹 𝑚 ) 𝑚 > 0 and ( 𝑃 𝑛 ) 𝑛 > 0 be the Fibonacci and Padovan sequences given by the initial conditions 𝐹 0 = 0 , 𝐹 1 = 1 , 𝑃 0 = 0 , 𝑃 1 = 𝑃 2 = 1 and the recurrence formulas 𝐹 𝑚 +2 = 𝐹 𝑚 +1 + 𝐹 𝑚 , 𝑃 𝑛 +3 = 𝑃 𝑛 +1 + 𝑃 𝑛 for all 𝑚, 𝑛 > 0 , respectively. In this note we study and completely solve the Diophantine\",\"PeriodicalId\":43454,\"journal\":{\"name\":\"Annales Mathematicae et Informaticae\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Mathematicae et Informaticae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33039/ami.2019.09.001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae et Informaticae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/ami.2019.09.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 3

摘要

让(𝐹𝑚)𝑚> 0,(𝑃𝑛)𝑛> 0是斐波那契和Padovan序列的初始条件𝐹0 = 0,𝐹1 = 1,𝑃0 = 0,𝑃1 =𝑃2 = 1,递推公式𝐹𝑚+ 2 =𝐹𝑚+ 1 +𝐹𝑚,𝑃𝑛+ 3 =𝑃𝑛+ 1 +𝑃𝑛𝑚,𝑛> 0,分别。在这篇笔记中，我们研究并彻底解决了丢番图

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Pillai’s problem with the Fibonacci andPadovan sequences

Let ( 𝐹 𝑚 ) 𝑚 > 0 and ( 𝑃 𝑛 ) 𝑛 > 0 be the Fibonacci and Padovan sequences given by the initial conditions 𝐹 0 = 0 , 𝐹 1 = 1 , 𝑃 0 = 0 , 𝑃 1 = 𝑃 2 = 1 and the recurrence formulas 𝐹 𝑚 +2 = 𝐹 𝑚 +1 + 𝐹 𝑚 , 𝑃 𝑛 +3 = 𝑃 𝑛 +1 + 𝑃 𝑛 for all 𝑚, 𝑛 > 0 , respectively. In this note we study and completely solve the Diophantine

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Annales Mathematicae et Informaticae MATHEMATICS-

CiteScore

0.90

自引率

0.00%

发文量