Let $ a $, $ b $, $ c $ be fixed coprime positive integers with $\min\{a, b, c\}> 1$. In this
survey, we consider some unsolved problems and related works concerning the positive …

A generalization of the well-known Fibonacci sequence {Fn} n≥ 0 given by F0= 0, F1= 1
and Fn+ 2= Fn+ 1+ Fn for all n≥ 0 is the k-generalized Fibonacci sequence {F(k) n} n≥ 1 …

Mathematics | Free Full-Text | Lucas Numbers Which Are Concatenations of Two Repdigits Next
Article in Journal Improved Performance of M-Class PMUs Based on a Magnitude Compensation …

On the exponential Diophantine equation $P_n^x+P_{n+1}^x=P_m$ Page 1 Turkish
Journal of Mathematics Volume 43 Number 3 Article 39 1-1-2019 On the exponential …

Abstract Let $(F_n) _ {n\geq 0} $ be the Fibonacci sequence given by $ F_ {m+ 2}= F_ {m+
1}+ F_m $, for $ m\geq 0$, where $ F_0= 0$ and $ F_1= 1$. A well-known generalization of …

ON THE DIOPHANTINE EQUATION Fx 1. Introduction. Let (Fn)n≥0 be the Fibonacci sequence
given by F0 = 0, F1 = 1 and Fn+2 = Fn+1 Page 1 ROCKY MOUNTAIN JOURNAL OF …

Abstract. Let k≥ 1 and g≥ 2 be positive integers. Any positive integer N of the form where
d1,…, dk∈{0, 1,…, g–1} with d1≠ 0, can be viewed as a concatenation of k repdigits in base …

arXiv:1811.03015v1 [math.NT] 2 Nov 2018 Page 1 arXiv:1811.03015v1 [math.NT] 2 Nov 2018
AN EXPONENTIAL DIOPHANTINE EQUATION RELATED TO THE DIFFERENCE BETWEEN …

In this paper, we study the problem of the explicit intersection of two sequences. More
specifically, we find all repdigits (ie, numbers with only one repeated digit in its decimal …

In this paper, we will answer the question of when the sum or the difference of x th powers of
any two Fibonacci numbers becomes a Fibonacci number or a Lucas number. We prove that …