关于两个基本递归序列的注记

IF 0.4 Q4 MATHEMATICS
Reza Farhadian, R. Jakimczuk
{"title":"关于两个基本递归序列的注记","authors":"Reza Farhadian, R. Jakimczuk","doi":"10.2478/amsil-2021-0007","DOIUrl":null,"url":null,"abstract":"Abstract In this note, we establish some general results for two fundamental recursive sequences that are the basis of many well-known recursive sequences, as the Fibonacci sequence, Lucas sequence, Pell sequence, Pell-Lucas sequence, etc. We establish some general limit formulas, where the product of the first n terms of these sequences appears. Furthermore, we prove some general limits that connect these sequences to the number e(≈ 2:71828:::).","PeriodicalId":52359,"journal":{"name":"Annales Mathematicae Silesianae","volume":"35 1","pages":"172 - 183"},"PeriodicalIF":0.4000,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Note on Two Fundamental Recursive Sequences\",\"authors\":\"Reza Farhadian, R. Jakimczuk\",\"doi\":\"10.2478/amsil-2021-0007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this note, we establish some general results for two fundamental recursive sequences that are the basis of many well-known recursive sequences, as the Fibonacci sequence, Lucas sequence, Pell sequence, Pell-Lucas sequence, etc. We establish some general limit formulas, where the product of the first n terms of these sequences appears. Furthermore, we prove some general limits that connect these sequences to the number e(≈ 2:71828:::).\",\"PeriodicalId\":52359,\"journal\":{\"name\":\"Annales Mathematicae Silesianae\",\"volume\":\"35 1\",\"pages\":\"172 - 183\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Mathematicae Silesianae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/amsil-2021-0007\",\"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 Silesianae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/amsil-2021-0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

摘要在本文中,我们建立了两个基本递归序列的一些一般结果,这两个序列是许多著名递归序列的基础,如Fibonacci序列、Lucas序列、Pell序列、Pell-Lucas序列等。我们建立了一些一般极限公式,其中这些序列的前n项的乘积出现。此外,我们还证明了将这些序列连接到数e(≈2:71828::)的一些一般极限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Note on Two Fundamental Recursive Sequences
Abstract In this note, we establish some general results for two fundamental recursive sequences that are the basis of many well-known recursive sequences, as the Fibonacci sequence, Lucas sequence, Pell sequence, Pell-Lucas sequence, etc. We establish some general limit formulas, where the product of the first n terms of these sequences appears. Furthermore, we prove some general limits that connect these sequences to the number e(≈ 2:71828:::).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annales Mathematicae Silesianae
Annales Mathematicae Silesianae Mathematics-Mathematics (all)
CiteScore
0.60
自引率
25.00%
发文量
17
审稿时长
27 weeks
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信