Hostname: page-component-6bf8c574d5-vmclg Total loading time: 0 Render date: 2025-02-17T12:56:02.965Z Has data issue: false hasContentIssue false
  • English
  • Français

Terms of Lucas sequences having a large smooth divisor

Part of: Sequences and sets

Published online by Cambridge University Press:  25 March 2022

Nikhil Balaji  and
Florian Luca Open the ORCID record for Florian Luca [Opens in a new window]
Nikhil Balaji*
Affiliation:
Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi 110016, India
Florian Luca
Affiliation:
School of Maths Wits University, 1 Jan Smuts, Braamfontein, Johannesburg 2000, South Africa Research Group in Algebric Structures and Applications, King Abdulaziz University, Abdulah Sulayman, Jeddah 22254, Saudi Arabia Centro de Ciencias Matemáticas UNAM, Morelia, Mexico e-mail: [email protected]
*
e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that the $Kn$ –smooth part of $a^n-1$ for an integer $a>1$ is $a^{o(n)}$ for most positive integers n.

Keywords

Linearly recurrent sequencesLucas sequencesABC conjecture

MSC classification

Primary: 11B39: Fibonacci and Lucas numbers and polynomials and generalizations
Secondary: 11B37: Recurrences 11B65: Binomial coefficients; factorials; $q$-identities
Type
Article
Information
Canadian Mathematical Bulletin , Volume 66 , Issue 1 , March 2023 , pp. 225 - 231
Check for updates
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Canadian Mathematical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bostan, A. and Mori, R., A simple and fast algorithm for computing the  $N$ -th term of a linearly recurrent sequence . SOSA 2021, 118–132.Google Scholar
Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers. Sixth edition. Revised by Heath-Brown, D. R. and Silverman, J. H.. With a foreword by Andrew Wiles. Oxford University Press, Oxford, 2008. xxii+621 pp.Google Scholar
Lipton, R. J., Straight-line complexity and integer factorization . ANTS 1994, 71–79.Google Scholar
Murty, R. and Wong, S., The ABC conjecture and prime divisors of the Lucas and Lehmer sequences . In Number theory for the millennium, III (Urbana, IL, 2000), A K Peters, Natick, MA, 2002, pp. 43–54.Google Scholar
Shamir, A., Factoring numbers in O(logn) arithmetic steps . Inf. Process. Lett. 8(1979), no. 1, 28–31.Google Scholar
Shparlinski, I. E., Some arithmetic properties of recurrence sequences . Math. Zam. 47(1990), 124–131; Translation in Math. Notes 47 (1990), 612–617.Google Scholar
Stewart, C. L., On divisors of Lucas and Lehmer numbers . Acta Math. 211(2013), 291–314.Google Scholar