2019
DOI: 10.1016/j.jnt.2018.11.025
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Cullen numbers in linear recurrence sequences

Abstract: A Cullen number is a number of the form m2 m + 1, where m is a positive integer. In 2004, Luca and Stȃnicȃ proved, among other things, that the largest Fibonacci number in the Cullen sequence is F 4 = 3. Actually, they searched for generalized Cullen numbers among some binary recurrence sequences. In this paper, we will work on higher order recurrence sequences. For a given linear recurrence (G n ) n , under weak assumptions, and a given polynomial T (x) ∈ Z[x], we shall prove that if G n = mx m + T (x), then … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 22 publications
0
10
0
Order By: Relevance
“…The last equation holds for only finitely many values of n. In the case where the inequality b + 1 < rad(b(b + 1)) 2 does not hold, the abc conjecture with ǫ = 1 says that we only have examples for finitely many values of b. Therefore, there are only finitely many n such that C s,n is a repunit of length three.…”
Section: Resultsmentioning
confidence: 98%
See 2 more Smart Citations
“…The last equation holds for only finitely many values of n. In the case where the inequality b + 1 < rad(b(b + 1)) 2 does not hold, the abc conjecture with ǫ = 1 says that we only have examples for finitely many values of b. Therefore, there are only finitely many n such that C s,n is a repunit of length three.…”
Section: Resultsmentioning
confidence: 98%
“…As the abc conjecture, with ǫ = 1, implies that there are at most finitely many pairs (x, m) such that x m > rad(x(x m − 1)) 2 , there are finitely many s-Cullen numbers for any fixed s that are also repunits of length greater than three.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Bilu et. al., [3] studied the occurrence of generalized Cullen numbers in a fixed linear recurrence sequences. In particular, they proved that there are finitely many solutions in integers (n, m, x) of the Diophantine equation…”
Section: Introductionmentioning
confidence: 99%
“…However, there is an error in their proof [3,Theorem 1]. For instance, consider the linear recurrence sequence of order three defined by the recurrence relation…”
Section: Introductionmentioning
confidence: 99%