首页> 外文期刊>The Fibonacci quarterly >A DIOPHANTINE EQUATION RELATED TO THE SUM OF SQUARES OF CONSECUTIVE k-GENERALIZED FIBONACCI NUMBERS
【24h】

A DIOPHANTINE EQUATION RELATED TO THE SUM OF SQUARES OF CONSECUTIVE k-GENERALIZED FIBONACCI NUMBERS

机译:与连续k广义斐波那契数的平方和有关的Diophantine方程

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Let (F_n)_(≥0) be the Fibonacci sequence given by F_(n+2) = F_(n+1) + F_n, for n ≥ 0, where F_0 = 0 and F_1 = 1. There are several interesting identities involving this sequence such as F_n~2 +F_(n+1)~2 = F_(2n+1), for all n ≥ 0. One of the most known generalizations of the Fibonacci sequence, is the k-generalized Fibonacci sequence (F_n~((k)))_n which is defined by the initial values 0, 0,. . ., 0, 1 (k terms) and such that each term afterwards is the sum of the k preceding terms. In this paper, we prove that contrarily to the Fibonacci case, the Diophantine equation (F_n~((k)))~2 + (F_(n+1)~((k)))~2 = F_m~((k)) has no any solution in positive integers n,m and k, with n > 1 and k ≥ 3.
机译:令(F_n)_(≥0)是由F_(n + 2)= F_(n + 1)+ F_n给出的斐波那契数列,对于n≥0,其中F_0 = 0和F_1 =1。有几个有趣的恒等式对于所有n≥0,涉及到该序列,例如F_n〜2 + F_(n + 1)〜2 = F_(2n + 1)。Fibonacci序列最广为人知的概括之一是k广义Fibonacci序列( F_n〜(((k)))_ n由初始值0、0定义。 。 ,...,0、1(k个项),并且之后的每个项都是k个在前项的总和。在本文中,我们证明与斐波那契情况相反,丢番图方程(F_n〜((k)))〜2 +(F_(n + 1)〜((k)))〜2 = F_m〜((k ))没有正整数n,m和k的任何解,n> 1并且k≥3。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号