【24h】

On the Periods of Fibonacci Sequences Mod N

机译:关于斐波那契数列Mod N的周期

获取原文

摘要

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.
机译:获得斐波纳契模数序列的最小周期的上限,即6N,比当前结果更准确,更方便。由于斐波那契模数序列的最小周期是二维Arnold变换的两倍,因此Arnold变换的最小模数周期的上限自然是3N。与文献中现有的最佳上限N2 / 2相比,这是一个很大的进步。此外,还获得了许多重要的特性,这些特性为研究Arnold变换的周期以及图像编码和处理的必要数学参考提供了新的思路。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号