关于广义Lucas序列的一些新结果

IF 0.8 4区 数学 Q2 MATHEMATICS
D. Andrica, O. Bagdasar, George C. Ţurcaş
{"title":"关于广义Lucas序列的一些新结果","authors":"D. Andrica, O. Bagdasar, George C. Ţurcaş","doi":"10.2478/auom-2021-0002","DOIUrl":null,"url":null,"abstract":"Abstract In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits for them (Theorem 6). We formulate necessary and sufficient arithmetic conditions which can identify the terms of a-Fibonacci and a-Lucas sequences. Finally, using a deep theorem of Siegel, we show that the aforementioned sequences contain only finitely many perfect powers. During the process we also discover some novel integer sequences.","PeriodicalId":55522,"journal":{"name":"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica","volume":"90 1","pages":"17 - 36"},"PeriodicalIF":0.8000,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On some new results for the generalised Lucas sequences\",\"authors\":\"D. Andrica, O. Bagdasar, George C. Ţurcaş\",\"doi\":\"10.2478/auom-2021-0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits for them (Theorem 6). We formulate necessary and sufficient arithmetic conditions which can identify the terms of a-Fibonacci and a-Lucas sequences. Finally, using a deep theorem of Siegel, we show that the aforementioned sequences contain only finitely many perfect powers. During the process we also discover some novel integer sequences.\",\"PeriodicalId\":55522,\"journal\":{\"name\":\"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica\",\"volume\":\"90 1\",\"pages\":\"17 - 36\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2021-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2478/auom-2021-0002\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2478/auom-2021-0002","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

本文引入了计算不超过给定值x的广义Lucas和Pell-Lucas序列项个数的函数,并在一定条件下导出了它们的精确公式(定理3和定理4),建立了它们的渐近极限(定理6),给出了a- fibonacci和a-Lucas序列项的充分必要算术条件。最后,利用西格尔的一个深度定理,证明了上述数列只包含有限多个完美幂。在此过程中,我们还发现了一些新的整数序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On some new results for the generalised Lucas sequences
Abstract In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits for them (Theorem 6). We formulate necessary and sufficient arithmetic conditions which can identify the terms of a-Fibonacci and a-Lucas sequences. Finally, using a deep theorem of Siegel, we show that the aforementioned sequences contain only finitely many perfect powers. During the process we also discover some novel integer sequences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
0.00%
发文量
15
审稿时长
6-12 weeks
期刊介绍: This journal is founded by Mirela Stefanescu and Silviu Sburlan in 1993 and is devoted to pure and applied mathematics. Published by Faculty of Mathematics and Computer Science, Ovidius University, Constanta, Romania.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信