Geodesic
On the intersection of two distinct $k$-generalized Fibonacci sequences
Mathematica Bohemica, Tome 137 (2012) no. 4, pp. 403-413

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{(k)}=F_{n-1}^{(k)}+F_{n-2}^{(k)}+\cdots + F_{n-k}^{(k)}$, with initial conditions $0,0,\dots ,0,1$ ($k$ terms) and such that the first nonzero term is $F_1^{(k)}=1$. The sequences $F:=F^{(2)}$ and $T:=F^{(3)}$ are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation $F_n^{(k)}=F_m^{(\ell )}$. In this note, we use transcendental tools to provide a general method for finding the intersections $F^{(k)}\cap F^{(m)}$ which gives evidence supporting the Noe-Post conjecture. In particular, we prove that $F\cap T=\{0,1,2,13\}$.
Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{(k)}=F_{n-1}^{(k)}+F_{n-2}^{(k)}+\cdots + F_{n-k}^{(k)}$, with initial conditions $0,0,\dots ,0,1$ ($k$ terms) and such that the first nonzero term is $F_1^{(k)}=1$. The sequences $F:=F^{(2)}$ and $T:=F^{(3)}$ are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation $F_n^{(k)}=F_m^{(\ell )}$. In this note, we use transcendental tools to provide a general method for finding the intersections $F^{(k)}\cap F^{(m)}$ which gives evidence supporting the Noe-Post conjecture. In particular, we prove that $F\cap T=\{0,1,2,13\}$.
DOI : 10.21136/MB.2012.142996
Classification : 11B39, 11D61, 11J86
Keywords: $k$-generalized Fibonacci numbers; linear forms in logarithms; reduction method 
Marques, Diego. On the intersection of two distinct $k$-generalized Fibonacci sequences. Mathematica Bohemica, Tome 137 (2012) no. 4, pp. 403-413. doi: 10.21136/MB.2012.142996
@article{10_21136_MB_2012_142996,
     author = {Marques, Diego},
     title = {On the intersection of two distinct $k$-generalized {Fibonacci} sequences},
     journal = {Mathematica Bohemica},
     pages = {403--413},
     year = {2012},
     volume = {137},
     number = {4},
     doi = {10.21136/MB.2012.142996},
     mrnumber = {3058272},
     zbl = {1258.11026},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2012.142996/}
}
TY  - JOUR
AU  - Marques, Diego
TI  - On the intersection of two distinct $k$-generalized Fibonacci sequences
JO  - Mathematica Bohemica
PY  - 2012
SP  - 403
EP  - 413
VL  - 137
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2012.142996/
DO  - 10.21136/MB.2012.142996
LA  - en
ID  - 10_21136_MB_2012_142996
ER  - 
%0 Journal Article
%A Marques, Diego
%T On the intersection of two distinct $k$-generalized Fibonacci sequences
%J Mathematica Bohemica
%D 2012
%P 403-413
%V 137
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2012.142996/
%R 10.21136/MB.2012.142996
%G en
%F 10_21136_MB_2012_142996

[1] Agronomof, M.: Sur une suite récurrente. Mathesis 4 (1914), 125-126 French.

[2] Alekseyev, M. A.: On the intersections of Fibonacci, Pell, and Lucas numbers. Integers 11 (2011), 239-259. | DOI | MR | Zbl

[3] Back, G., Caragiu, M.: The greatest prime factor and recurrent sequences. Fibonacci Q. 48 (2010), 358-362. | MR | Zbl

[4] Bugeaud, Y., Mignotte, M., Siksek, S.: Classical and modular approaches to exponential Diophantine equations I: Fibonacci and Lucas perfect powers. Ann. Math. 163 (2006), 969-1018. | DOI | MR | Zbl

[5] Carroll, D., Jacobson, E. T., Somer, L.: Distribution of two-term recurrence sequences mod $p^e$. Fibonacci Q. 32 (1994), 260-265. | MR

[6] Dujella, A., Pethö, A.: A generalization of a theorem of Baker and Davenport. Q. J. Math., Oxf. II Ser. 49 (1998), 291-306. | MR | Zbl

[7] Dresden, G. P.: A simplified Binet formula for $k$-generalized Fibonacci numbers. Preprint, arXiv:0905.0304v1.

[8] Erdös, P., Selfridge, J. L.: The product of consecutive integers is never a power. Illinois J. Math. 19 (1975), 292-301. | DOI | MR | Zbl

[9] Feinberg, M.: Fibonacci-Tribonacci. Fibonacci Q. 1 (1963), 71-74.

[10] Ferguson, D. E.: An expression for generalized Fibonacci numbers. Fibonacci Q. 4 (1966), 270-273. | MR | Zbl

[11] Flores, I.: Direct calculation of $k$-generalized Fibonacci numbers. Fibonacci Q. 5 (1967), 259-266. | MR | Zbl

[12] Gabai, H.: Generalized Fibonacci $k$-sequences. Fibonacci Q. 8 (1970), 31-38. | MR | Zbl

[13] Jacobson, E. T.: Distribution of the Fibonacci numbers mod $2^k$. Fibonacci Q. 30 (1992), 211-215. | MR

[14] Kalman, D.: Generalized Fibonacci numbers by matrix methods. Fibonacci Q. 20 (1982), 73-76. | MR | Zbl

[15] Kessler, D., Schiff, J.: A combinatoric proof and generalization of Ferguson's formula for $k$-generalized Fibonacci numbers. Fibonacci Q. 42 (2004), 266-273. | MR | Zbl

[16] Klaška, J.: Tribonacci modulo $p^t$. Math. Bohem. 133 (2008), 267-288. | MR

[17] Klaška, J.: Tribonacci modulo $2^t$ and $11^t$. Math. Bohem. 133 (2008), 377-387. | MR

[18] Klaška, J.: A search for Tribonacci-Wieferich primes. Acta Math. Univ. Ostrav. 16 (2008), 15-20. | MR | Zbl

[19] Klaška, J.: On Tribonacci-Wieferich primes. Fibonacci Q. 46/47 (2008/09), 290-297. | MR

[20] Klaška, J.: Tribonacci partition formulas modulo $m$. Acta Math. Sin. (Engl. Ser.) 26 (2010), 465-476. | DOI | MR | Zbl

[21] Klaška, J., Skula, L.: The cubic character of the Tribonacci roots. Fibonacci Q. 48 (2010), 21-28. | MR | Zbl

[22] Klaška, J., Skula, L.: Periods of the Tribonacci sequence modulo a prime $p\equiv 1 \pmod 3$. Fibonacci Q. 48 (2010), 228-235. | MR | Zbl

[23] Klaška, J., Skula, L.: A note on the cubic characters of Tribonacci roots. Fibonacci Q. 48 (2010), 324-326. | MR | Zbl

[24] Lin, P. Y.: De Moivre-type identities for the Tribonacci numbers. Fibonacci Q. 26 (1988), 131-134. | MR | Zbl

[25] Luca, F.: Fibonacci and Lucas numbers with only one distinct digit. Port. Math. 57 (2000), 243-254. | MR | Zbl

[26] Luca, F.: Products of factorials in binary recurrence sequences. Rocky Mountain J. Math. 29 (1999), 1387-1411. | DOI | MR | Zbl

[27] Luca, F., Marques, D.: Perfect powers in the summatory function of the power tower. J. Théor. Nombres Bordx. 22 (2010), 703-718. | DOI | MR | Zbl

[28] Marques, D., Togbé, A.: Perfect powers among $C$-nomial coefficients. C. R. Acad. Sci. Paris I 348 (2010), 717-720. | DOI | MR

[29] Marques, D., Togbé, A.: On terms of linear recurrence sequences with only one distinct block of digits. Colloq. Math. 124 (2011), 145-155. | DOI | MR | Zbl

[30] Matveev, E. M.: An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II. Izv. Math. 64 1217-1269 (2000), translation from Izv. Ross. Akad. Nauk, Ser. Mat. 64 (2000), 125-180 (2000), 1217-1269. | DOI | MR | Zbl

[31] Mignotte, M.: Intersection des images de certaines suites récurrentes linéaires. Theor. Comput. Sci. 7 (1978), 117-121 French. | DOI | MR | Zbl

[32] Noe, T. D., Post, J. V.: Primes in Fibonacci $n$-step and Lucas $n$-step sequences. J. Integer Seq. 8 (2005). | MR | Zbl

[33] Pethö, A.: Fifteen problems in number theory. Acta Univ. Sapientiae Math. 2 (2010), 72-83. | MR | Zbl

[34] Schlickewei, H. P., Schmidt, W. M.: Linear equations in members of recurrence sequences. Ann. Sc. Norm. Super. Pisa, Cl. Sci., IV. Ser. 20 (1993), 219-246. | MR | Zbl

[35] Schlickewei, H. P., Schmidt, W. M.: The intersection of recurrence sequences. Acta Arith. 72 (1995), 1-44. | DOI | MR | Zbl

[36] Spickerman, W. R.: Binet's formula for the Tribonacci sequence. Fibonacci Q. 20 (1982), 118-120. | MR | Zbl

[37] Stein, S. K.: The intersection of Fibonacci sequences. Michigan Math. J. 9 (1962), 399-402. | DOI | MR | Zbl

[38] Waddill, E. M.: Some properties of a generalized Fibonacci sequence modulo $m$. Fibonacci Q. 16 (1978), 344-353. | MR | Zbl

[39] Wolfram, D. A.: Solving generalized Fibonacci recurrences. Fibonacci Q. 36 (1998), 129-145. | MR | Zbl

Cité par Sources :