Euler indicators of binary recurrence sequences

• Autores: Florian Luca
• Localización: Collectanea mathematica, ISSN 0010-0757, Vol. 53, Fasc. 2, 2002, págs. 133-156
• Idioma: inglés
• Títulos paralelos:
  • Indicadores de Euler de sucesiones binarias por recurrencia
• Enlaces
  • Texto completo
• Resumen

  • In this paper, we show that if $(u_n)_n\geq 0$ and $(v_n)_n\geq 0$ are two non-degenerate binary recurrent sequences of integers such that $(v_n)_n\geq 0$ satisfies some technical assumptions, then the diophantine equation $\vert v_n\vert = \phi(\vert u_m\vert)$ has only finitely many effectively computable positive integer solutions $(m,n)$. Here, for a nonzero integer $k$ we use $\phi(k)$ to denote the Euler function of $k$.

• Referencias bibliográficas
  • A. Baker and G. Wüstholz, Logarithmic forms and group varieties, J. Reine Angew. Math. 442 (1993), 19–62.
  • R.D. Carmichael, On the numerical factors of the arithmetic forms $\alpha^n \pm \beta^n$, Ann. Math. 15 (1913), 30–70.
  • F. Luca, On the equation $\phi(|x^m+y^m|)=|x^n+y^n|$, Indian J. Pure Appl. Math. 30 (1999), 183–197.
  • F. Luca, On the equation $\phi(x^m-y^m)=x^n+y^n$, Irish Math. Soc. Bull. 40 (1998) 46–55.
  • F. Luca, Equations involving arithmetic functions of Fibonacci and Lucas numbers, Fibonacci Quart. 38 (2000), 49–55.
  • F. Luca, Pascal's triangle and constructible polygons, Util. Math. 58 (2000), 209–214.
  • T.N. Shorey, A.J. Van der Poorten, R. Tijdeman, and A. Schinzel, Applications of the Gel'fond-Baker method to Diophantine equations, Transcendence...
  • C.L. Stewart, On divisors of terms of linear recurrence sequences, J. Reine Angew. Math. 333 (1982), 12–31.
  • K.R. Yu, Linear forms in $p$-adic logarithms III, Compositio Math. 91 (1994), 241–276.