数学
整数(计算机科学)
猜想
组合数学
上下界
离散数学
数学分析
计算机科学
程序设计语言
作者
Harold Erazo,Carlos A. Gómez,Florian Luca
标识
DOI:10.1142/s1793042121500871
摘要
In this paper, we show that if [Formula: see text] is the [Formula: see text]th solution of the Pell equation [Formula: see text] for some non-square [Formula: see text], then given any integer [Formula: see text], the equation [Formula: see text] has at most [Formula: see text] integer solutions [Formula: see text] with [Formula: see text] and [Formula: see text], except for the only pair [Formula: see text]. Moreover, we show that this bound is optimal. Additionally, we propose a conjecture about the number of solutions of Pillai’s problem in linear recurrent sequences.
科研通智能强力驱动
Strongly Powered by AbleSci AI