斐波纳契数
丢番图方程
数学
整数(计算机科学)
组合数学
素数(序理论)
丢番图集
离散数学
主要因素
计算机科学
程序设计语言
作者
Pantelimon Stănică,Florian Luca
摘要
In this paper, we show that the diophantine equation Fn = p a ± p b has only finitely many positive integer solutions (n,p,a,b), where p is a prime number and max{a,b} 2.
科研通智能强力驱动
Strongly Powered by AbleSci AI