Linear recurrences of order at most two in nontrivial small divisors and large divisors

Abstract

For each positive integer N, define S'N \ =\ \1 < d < N: d|N\ and L'N \ =\ \N < d < N : d|N\. Recently, Chentouf characterized all positive integers N such that the set of small divisors \d N: d|N\ satisfies a linear recurrence of order at most two. We nontrivially extend the result by excluding the trivial divisor 1 from consideration, which dramatically increases the analysis complexity. Our first result characterizes all positive integers N such that S'N satisfies a linear recurrence of order at most two. Moreover, our second result characterizes all positive N such that L'N satisfies a linear recurrence of order at most two, thus extending considerably a recent result that characterizes N with L'N being in an arithmetic progression.

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…