2021
DOI: 10.1007/s40590-021-00377-5
|View full text |Cite
|
Sign up to set email alerts
|

Repdigits base b as products of two Pell numbers or Pell–Lucas numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…In the litterature, there are many papers that combine repdigits and recurrent sequences. For more details the reader can refer to ( [3], [5], [7], [8], [9], [10], [12]). Recently, the second author, Filipin and Togbé found in [2] all padovan and perrin numbers which are products of two repdigits in base 𝑏 with 2 ≤ 𝑏 ≤ 10.…”
Section: P𝑚 or E𝑚 Which Are Products Of Three Repdigits In Base δmentioning
confidence: 99%
“…In the litterature, there are many papers that combine repdigits and recurrent sequences. For more details the reader can refer to ( [3], [5], [7], [8], [9], [10], [12]). Recently, the second author, Filipin and Togbé found in [2] all padovan and perrin numbers which are products of two repdigits in base 𝑏 with 2 ≤ 𝑏 ≤ 10.…”
Section: P𝑚 or E𝑚 Which Are Products Of Three Repdigits In Base δmentioning
confidence: 99%
“…The determination of the terms of linear recurrent sequences which are product or concatenations of two or three repdigits have been widely studied. For details of recent work related to this problem, we refer the reader to [5,6,7,8,9,10,11,12,13]. Our work aims to be more general than previous work.…”
Section: Introductionmentioning
confidence: 99%
“…For application, we determined in section 4 all members of Narayana's cows numbers that are concatenations of three repdigits in the cases 2 ρ 10. The main results are as follows : For the proof of Theorem 1.1, we use n > 560 by writting (11) in three different ways to get three linear forms in logarithms. We apply lower bound for linear forms in logarithms to obtain an upper bound on n. We need some preliminary results which are discussed in the following section.…”
Section: Introductionmentioning
confidence: 99%