2000 character limit reached
Strong divisibility sequences and sieve methods
Published 29 Feb 2024 in math.NT | (2402.19301v1)
Abstract: We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic divisibility sequences, discussing the limitations of our methods. At the end of the paper there is an appendix by Sandro Bettin on divisor closed sets, that we use to study the density of prime terms that appear in strong divisibility sequences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.