On the Periods of Fibonacci Sequences Mod N

Yong-jiang Li, Chang-li Li, Jian-hua Ge, Z. Sun
{"title":"On the Periods of Fibonacci Sequences Mod N","authors":"Yong-jiang Li, Chang-li Li, Jian-hua Ge, Z. Sun","doi":"10.1109/LEITS.2010.5664966","DOIUrl":null,"url":null,"abstract":"An upper bound for the smallest period of the Fibonacci module sequence is obtained, which is 6N, and more accurate and convenient than the current results. Since the smallest period of the Fibonacci module sequence is twice of that of two-dimensional Arnold transformation, the upper bound for the smallest module period of Arnold transformation is naturally 3N. It is a great advance compared with the existing best upper bound N2/2 in the literatures. Moreover, many important properties are gained, which provide new thought for study on the period of Arnold transformation and the necessary mathematical reference of image coding and processing.","PeriodicalId":173716,"journal":{"name":"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LEITS.2010.5664966","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An upper bound for the smallest period of the Fibonacci module sequence is obtained, which is 6N, and more accurate and convenient than the current results. Since the smallest period of the Fibonacci module sequence is twice of that of two-dimensional Arnold transformation, the upper bound for the smallest module period of Arnold transformation is naturally 3N. It is a great advance compared with the existing best upper bound N2/2 in the literatures. Moreover, many important properties are gained, which provide new thought for study on the period of Arnold transformation and the necessary mathematical reference of image coding and processing.
关于N模斐波那契数列的周期
得到了Fibonacci模序列最小周期的上界为6N,比现有的结果更加准确和方便。由于Fibonacci模序列的最小周期是二维Arnold变换的2倍,所以Arnold变换的最小模周期的上界自然是3N。与文献中已有的最佳上界N2/2相比,这是一个很大的进步。此外,还获得了许多重要的性质,为研究Arnold变换的周期提供了新的思路,为图像编码和处理提供了必要的数学参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信