Abstract:Let {Ln} n≥0 be the sequence of Lucas numbers given by L0 = 2, L1 = 1 and Ln+2 = Ln+1 + Ln for all n ≥ 0. In this paper, for an integer d ≥ 2 which is square-free, we show that there is at most one value of the positive integer x participating in the Pell equation x 2 − dy 2 = ±1 which is a product of two Lucas numbers, with a few exceptions that we completely characterize.
“…The articles that use Lucas numbers (1) , x-coordinate of Pell's equation with powers of 2 (2) , and Fibonacci numbers (3) in Pell equations served as inspirations for this article. New types of rectangles and triangles are defined and some of their properties are explored by using Diophantine equations in articles (4,5) .…”
Objectives:The main aim of this article is to discuss the existence or nonexistence of 2-Peble triangles over some figurate numbers. Methods: A few quartic equations over integers are solved to complete the objective at hand. This is done with the aid of the transformation of variables. Additionally, fundamental concepts such as mathematical induction and parity of integers are used. Findings: Here, it is demonstrated that there are no 2-Peble triangles over triangular, hexagonal, and octagonal numbers. The same process is explained for particular special numbers as an exceptional instance. Novelty: This article defines a triangle, the d-Peble triangle over figurate numbers, which creates a link between the Pell equation and a common geometric shape. So many previous researchers, when examining a problem involving geometric shapes, attain their expected result using Diophantine equations. But this concept differs from those as this uses figurate numbers and a Pell equation to create a triangle.
“…The articles that use Lucas numbers (1) , x-coordinate of Pell's equation with powers of 2 (2) , and Fibonacci numbers (3) in Pell equations served as inspirations for this article. New types of rectangles and triangles are defined and some of their properties are explored by using Diophantine equations in articles (4,5) .…”
Objectives:The main aim of this article is to discuss the existence or nonexistence of 2-Peble triangles over some figurate numbers. Methods: A few quartic equations over integers are solved to complete the objective at hand. This is done with the aid of the transformation of variables. Additionally, fundamental concepts such as mathematical induction and parity of integers are used. Findings: Here, it is demonstrated that there are no 2-Peble triangles over triangular, hexagonal, and octagonal numbers. The same process is explained for particular special numbers as an exceptional instance. Novelty: This article defines a triangle, the d-Peble triangle over figurate numbers, which creates a link between the Pell equation and a common geometric shape. So many previous researchers, when examining a problem involving geometric shapes, attain their expected result using Diophantine equations. But this concept differs from those as this uses figurate numbers and a Pell equation to create a triangle.
“…We mention a few such recent results; the interested reader may consult their references. In the papers [1,2,3,4,5,6,8,11,15,16,19] the authors provide various finiteness results concerning the values (or sums or products of values) of certain concrete recurrence sequences (such as Fibonacci, Tribonacci, generalized Fibonacci, Lucas, Padovan, Pell, repdigits) in the x coordinate of equation (1), for the cases t = ±1, ±4. Concerning the y-coordinate, we are aware only of two related results.…”
In this paper, we completely describe those recurrence sequences which have infinitely many terms in the solution sets of generalized Pell equations. Further, we give an upper bound for the number of such terms when there are only finitely many of them.
“…This is sequence A000931 on the On-Line Encyclopedia of Integer Sequences (OEIS) [21]. The first few terms of this sequence are 3,4,5,7,9,12,16,21,28,37,49,65,86,114,151, . .…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we let U := {P n P m : n ≥ m ≥ 0} be the sequence of products of two Padovan numbers. The first few members of U are U = {0, 1, 2, 3,4,5,6,7,8,9,10,12,14,15,16,18,20,21,24,25, 27, 28, 32, 35, . .…”
Section: Introductionmentioning
confidence: 99%
“…Several other related problems have been studied where x l belongs to some interesting positive integer sequences. For example, see [2,3,6,7,8,9,10,12,15,16,17,18,19].…”
Let {P n } n≥0 be the sequence of Padovan numbers defined by P 0 = 0, P 1 = P 2 = 1, and P n+3 = P n+1 + P n for all n ≥ 0. In this paper, we find all positive square-free integers d ≥ 2 such that the Pell equations x 2 − dy 2 = , where ∈ {±1, ±4}, have at least two positive integer solutions (x, y) and (x , y ) such that each of x and x is a product of two Padovan numbers.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.