On the congruence properties and growth rate of a recursively defined sequence

Abstract

Let a1 = 1 and, for n > 1, an = an-1 + a n2 . In this paper we will look at congruence properties and the growth rate of this sequence. First we will show that if x ∈ \1, 2, 3, 5, 6, 7 \, then the natural density of n such that an x 8 exists and equals 16. Next we will prove that if m 15 is not divisible by 4, then the lower density of n such that an is divisible by m, is strictly positive. To put these results in a broader context, we will then posit a general conjecture about the density of n such that an x m for any given x and any m not divisible by 32. Finally, we will show that there exists a function f such that nf(n) < an < nf(n) + ε for all ε > 0 and all large enough n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…