On numbers n dividing the nth term of a linear recurrence | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/195607

7 Visitors

26 Hits

4 Downloads

File	Description	Size	Format
DS01	Publisher version (open access)	273 KB	Adobe Acrobat PDF	View/Open

Title: On numbers n dividing the nth term of a linear recurrence
Related: Proceedings of the Edinburgh Mathematical Society, Vol. 55, No. 2, (2012), p.271-289
DOI: 10.1017/S0013091510001355
Publisher: Cambridge University Press
Date: 2012
Author/Creator: González, Juan José Alba
Author/Creator: Luca, Florian
Author/Creator: Pomerance, Carl
Author/Creator: Shparlinski, Igor E
Description: We give upper and lower bounds on the count of positive integers n <= x dividing the nth term of a non-degenerate linearly recurrent sequence with simple roots.
Description: 19 page(s)
Subject Keyword: linear recurrence
Subject Keyword: Lucas sequence
Subject Keyword: divisibility
Resource Type: journal article
Organisation: Macquarie University. Dept. of Computing

Macquarie University ResearchOnline