皮莱对帕多万数字和2的幂的问题

Q4 Mathematics

Revista Colombiana de Matematicas Pub Date : 2019-01-01 DOI:10.15446/recolma.v53n1.81034

Ana María García Lomeli, Santos Hernández Hernández

{"title":"皮莱对帕多万数字和2的幂的问题","authors":"Ana María García Lomeli, Santos Hernández Hernández","doi":"10.15446/recolma.v53n1.81034","DOIUrl":null,"url":null,"abstract":"Let (Pn)n≥0 be the Padovan sequence given by P0 = 0, P1 = P2 = 1 and the recurrence formula Pn+3 = Pn+1 + Pn for all n ≥ 0. In this note we study and completely solve the Diophantine equation Pn - 2m = Pn1 - 2m1 in non-negative integers (n, m, n1, m1).","PeriodicalId":38102,"journal":{"name":"Revista Colombiana de Matematicas","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15446/recolma.v53n1.81034","citationCount":"7","resultStr":"{\"title\":\"Pillai's problem with Padovan numbers and powers of two\",\"authors\":\"Ana María García Lomeli, Santos Hernández Hernández\",\"doi\":\"10.15446/recolma.v53n1.81034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let (Pn)n≥0 be the Padovan sequence given by P0 = 0, P1 = P2 = 1 and the recurrence formula Pn+3 = Pn+1 + Pn for all n ≥ 0. In this note we study and completely solve the Diophantine equation Pn - 2m = Pn1 - 2m1 in non-negative integers (n, m, n1, m1).\",\"PeriodicalId\":38102,\"journal\":{\"name\":\"Revista Colombiana de Matematicas\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.15446/recolma.v53n1.81034\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista Colombiana de Matematicas\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15446/recolma.v53n1.81034\",\"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":"Revista Colombiana de Matematicas","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15446/recolma.v53n1.81034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 7

摘要

令(Pn)n≥0为P0 = 0, P1 = P2 = 1给出的Padovan序列，且对于所有n≥0，递归式Pn+3 = Pn+1 + Pn。本文研究并完全解非负整数(n, m, n1, m1)的丢芬图方程Pn - 2m = Pn1 - 2m1。

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

查看原文本刊更多论文

Pillai's problem with Padovan numbers and powers of two

Let (Pn)n≥0 be the Padovan sequence given by P0 = 0, P1 = P2 = 1 and the recurrence formula Pn+3 = Pn+1 + Pn for all n ≥ 0. In this note we study and completely solve the Diophantine equation Pn - 2m = Pn1 - 2m1 in non-negative integers (n, m, n1, m1).

求助全文

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

来源期刊

Revista Colombiana de Matematicas Mathematics-Mathematics (all)

CiteScore

0.60

自引率

0.00%

发文量