关于具有斐波那契数和3次幂的Pillai问题。

IF 0.9 Q2 MATHEMATICS BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA Pub Date : 2020-01-01 Epub Date: 2019-09-17 DOI:10.1007/s40590-019-00263-1

Mahadi Ddamulira

{"title":"关于具有斐波那契数和3次幂的Pillai问题。","authors":"Mahadi Ddamulira","doi":"10.1007/s40590-019-00263-1","DOIUrl":null,"url":null,"abstract":"Consider the sequence <math> <msub><mrow><mo>{</mo> <msub><mi>F</mi> <mi>n</mi></msub> <mo>}</mo></mrow> <mrow><mi>n</mi> <mo>≥</mo> <mn>0</mn></mrow> </msub> </math> of Fibonacci numbers defined by <math> <mrow><msub><mi>F</mi> <mn>0</mn></msub> <mo>=</mo> <mn>0</mn></mrow> </math> , <math> <mrow><msub><mi>F</mi> <mn>1</mn></msub> <mo>=</mo> <mn>1</mn></mrow> </math> , and <math> <mrow><msub><mi>F</mi> <mrow><mi>n</mi> <mo>+</mo> <mn>2</mn></mrow> </msub> <mo>=</mo> <msub><mi>F</mi> <mrow><mi>n</mi> <mo>+</mo> <mn>1</mn></mrow> </msub> <mo>+</mo> <msub><mi>F</mi> <mi>n</mi></msub> </mrow> </math> for all <math><mrow><mi>n</mi> <mo>≥</mo> <mn>0</mn></mrow> </math> . In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 3.","PeriodicalId":45404,"journal":{"name":"BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s40590-019-00263-1","citationCount":"7","resultStr":"{\"title\":\"On a problem of Pillai with Fibonacci numbers and powers of 3.\",\"authors\":\"Mahadi Ddamulira\",\"doi\":\"10.1007/s40590-019-00263-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consider the sequence <math> <msub><mrow><mo>{</mo> <msub><mi>F</mi> <mi>n</mi></msub> <mo>}</mo></mrow> <mrow><mi>n</mi> <mo>≥</mo> <mn>0</mn></mrow> </msub> </math> of Fibonacci numbers defined by <math> <mrow><msub><mi>F</mi> <mn>0</mn></msub> <mo>=</mo> <mn>0</mn></mrow> </math> , <math> <mrow><msub><mi>F</mi> <mn>1</mn></msub> <mo>=</mo> <mn>1</mn></mrow> </math> , and <math> <mrow><msub><mi>F</mi> <mrow><mi>n</mi> <mo>+</mo> <mn>2</mn></mrow> </msub> <mo>=</mo> <msub><mi>F</mi> <mrow><mi>n</mi> <mo>+</mo> <mn>1</mn></mrow> </msub> <mo>+</mo> <msub><mi>F</mi> <mi>n</mi></msub> </mrow> </math> for all <math><mrow><mi>n</mi> <mo>≥</mo> <mn>0</mn></mrow> </math> . In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 3.\",\"PeriodicalId\":45404,\"journal\":{\"name\":\"BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s40590-019-00263-1\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s40590-019-00263-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2019/9/17 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s40590-019-00263-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2019/9/17 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 7

摘要

认为《斐波那契序列{F n的n≥0的数字):由F - 0 = 0, F = 1和n + 2 = F F F n + 1 + n的所有n≥0。在这篇论文中，我们发现所有的情报c中至少有两种表现作为斐波那契数和三种权力的区别。

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

查看原文

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

本刊更多论文

On a problem of Pillai with Fibonacci numbers and powers of 3.

Consider the sequence ${F_{n}}_{n \geq 0}$ of Fibonacci numbers defined by $F_{0} = 0$ , $F_{1} = 1$ , and $F_{n + 2} = F_{n + 1} + F_{n}$ for all $n \geq 0$ . In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 3.