Repdigits as Euler functions of Lucas numbers

Jhon J. Bravo; Bernadette Faye; Florian Luca; Amadou Tall

doi:10.1515/auom-2016-0030

.blurhash-client-img { display: none !important; }

Repdigits as Euler functions of Lucas numbers

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

Volume 24 (2016): Issue 2 (June 2016)

By: Jhon J. Bravo, Bernadette Faye, Florian Luca and Amadou Tall

Open Access

|Sep 2017

Abstract

We prove some results about the structure of all Lucas numbers whose Euler function is a repdigit in base 10. For example, we show that if L_n is such a Lucas number, then n < 10¹¹¹ is of the form p or p², where p³ | 10^p-1 -1.

References

[1] A. Baker and H. Davenport,“The equations 3x2 - 2 = y2 and 8x2 - 7 = z2”, Quart. J. Math. Oxford Ser. (2) 20 (1969), 129-137.10.1093/qmath/20.1.129
Search in Google Scholar Back to article
[2] J. J. Bravo and F. Luca,“On a conjecture about repdigits in k- generalized Fibonacci sequences”, Publ. Math. Debrecen, 82 (2013), 623-639.10.5486/PMD.2013.5390
Open DOI Search in Google Scholar Back to article
[3] Y. Bugeaud, M. Mignotte and S. Siksek,“Classical and modular ap- proaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers”, Ann. of Math. (2) 163 (2006), 969-1018.10.4007/annals.2006.163.969
Search in Google Scholar Back to article
[4] Y. Bugeaud, F. Luca, M. Mignotte and S. Siksek,“Almost powers in the Lucas sequence”, J. N. T. Bordeaux 20 (2008), 555-600.10.5802/jtnb.642
Search in Google Scholar Back to article
[5] R. D. Carmichael,“On the numerical factors of the arithmetic forms _n _ _n”, Ann. Math. (2) 15 (1913), 30-70.10.2307/1967797
Open DOI Search in Google Scholar Back to article
[6] M. T. Damir, B. Faye, F. Luca and A. Tall,“Members of Lucas sequences whose Euler function is a power of 2”, Fibonacci Quarterly, to appear.
Search in Google Scholar Back to article
[7] A. Dujella and A. Peth}o,“A generalization of a theorem of Baker and Davenport”, Quart. J. Math. Oxford Ser. (2) 49 (1998), 291-306.10.1093/qmathj/49.3.291
Search in Google Scholar Back to article
[8] F. Luca,“Equations involving arithmetic functions of Fibonacci num- bers,” Fibonacci Quart. 38 (2000), 49-55.10.1080/00150517.2000.12428825
Search in Google Scholar Back to article
[9] F. Luca,“Euler indicators of binary recurrent sequences”, Collectanea Math. 53 (2002), 133-156.
Search in Google Scholar Back to article
[10] F. Luca and M. Mignotte,“_(F11) = 88”, Divulgaciones Mat. 14 (2006), 101-106.
Search in Google Scholar Back to article
[11] E. M. Matveev,“An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers”, Izv. Math. 64 (2000), 1217-1269.10.1070/IM2000v064n06ABEH000314
Search in Google Scholar Back to article
[12] W. L. McDaniel and P. Ribenboim,“Square-classes in Lucas sequences having odd parameters”, J. Number Theory 73 (1998), 14-27.10.1006/jnth.1998.2280
Search in Google Scholar Back to article

Articles in this issue

DOI: https://doi.org/10.1515/auom-2016-0030 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784

Journal RSS Feed

Language: English

Page range: 105 - 126

Published on: Sep 21, 2017

Published by: Ovidius University of Constanta

In partnership with: Paradigm Publishing Services

Publication frequency: 3 issues per year

Keywords:

Fibonacci numbers,

Lucas numbers,

Applications of linear forms in logarithms

Related subjects:

Mathematics,

General mathematics

© 2017 Jhon J. Bravo, Bernadette Faye, Florian Luca, Amadou Tall, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 24 (2016): Issue 2 (June 2016)