Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.