Papers
Topics
Authors
Recent
Search
2000 character limit reached

Common terms of generalized Pell and Narayana's cows sequences

Published 8 Jul 2023 in math.NT | (2307.03919v1)

Abstract: For an integer k≥2k \geq 2, let Pn<sup>(k)</sup><em>n{ P_{n}<sup>{(k)}</sup> }<em>{n} be the kk-generalized Pell sequence which starts with 0,…,0,10, \dots,0,1(kk terms) and each term afterwards is the sum of kk preceding terms. In this paper, we find all the solutions of the Diophantine equation P</em>n<sup>(k)</sup>=NmP</em>{n}<sup>{(k)}</sup> = N_{m} in non-negative integers (n,k,m)(n, k, m) with k≥2k \geq 2, where Nmm{ N_{m} }_m is the Narayana's cows sequence. Our approach utilizes the lower bounds for linear forms in logarithms of algebraic numbers established by Matveev, along with key insights from the theory of continued fractions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.