中文

丢番图方程 $a \left(\frac{b^k-1}{b-1}\right) = \mathcal{U}_n-\mathcal{U}_m$

数论 2023-06-08 v1

摘要

在此,我们求出标题中丢番图方程的所有正整数解,其中 (Un)n0(\mathcal{U}_n)_{n\geqslant 0} 是广义 Lucas 序列 U0=0, U1=1\mathcal{U}_0=0, \ \mathcal{U}_1=1Un+1=rUn+sUn1\mathcal{U}_{n+1}=r \mathcal{U}_n +s \mathcal{U}_{n-1},其中 rrss 为整数且满足 Δ=r2+4s>0\Delta = r^2 +4 s >0

关键词

引用

@article{arxiv.2306.04022,
  title  = {The Diophantine equation $a \left(\frac{b^k-1}{b-1}\right) = \mathcal{U}_n-\mathcal{U}_m$},
  author = {P. Tiebekabe and I. Diouf and A. Tall and K. R. Kakanou},
  journal= {arXiv preprint arXiv:2306.04022},
  year   = {2023}
}