1, we look at the smallest exponent n such that an is not a palindrome.]]>
1, nosotros estudiamos el menor exponente n tal que a n no sea palindromo.]]>
Santos Hernández Hernández*, Santigo Florian Luca**
* Pontificia Universidad Católica de Chile, Santiago
Facultad de Matemáticas, Vicuña Mackenna 4860
e-mail: shernand@mat.puc.cl
** Universidad Nacional Autónoma de México, México D. F.
Instituto de Matemáticas C.P. 58089, Morelia, Michoacán, México
]]> e-mail: fluca@matmor.unam.mx
Abstract. In this paper, given an integer a > 1, we look at the smallest exponent n such that an is not a palindrome.
Keywords and phrases. Palindromes, Applications of Baker's method, Discrepancy.
2000 Mathematics Subject Classification. Primary: 11D75. Secondary: 11J25, 11J71, 11J86.
Resumen. En este artículo, dado un entero a > 1, nosotros estudiamos el menor exponente n tal que an no sea palindromo.
FULL TEXT IN PDF
[1] W. D. Banks, D. N. Hart & M. Sakata, Almost all palindromes are composite, Math. Res. Lett. 11 (2004), 853-868. [ Links ]
[2] M. Harminic & R. Soták, Palindromic numbers in arithmetic progressions, Fibonacci Quart. 36 (1998), 259-261. [ Links ]
[3] I. Korec, Palindromic squares for various number system bases, Math. Slovaca 41 (1991), 261-276. [ Links ]
[4] L. Kuipers & H. Niederreiter, Uniform Distribution of Sequences, Wiley- Interscience, New-York, 1974. [ Links ]
[5] F. Luca, Palindromes in Lucas sequences, Monatsh. Math. 138 (2003), 209-223. [ Links ]
[6] E. M. Matveev, An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers II, Izv. Ross. Akad. Nauk. Ser. Math. 64 (2000), 125-180; English translation Izv. Math. 64 (2000), 1217-1269. [ Links ]
[7] J. Rivat & G. Tenenbaum, Constantes d'Erdös-Turán, Ramanujan J. 9 (2005), 111-121. [ Links ]
(Recibido en mayo de 2006. Aceptado en julio de 2006)
]]>