For each positive integer N, define \( S'_N \ =\ \{1 < d < \sqrt{N}: d|N\} \text{ and } L'_N \ =\ \{\sqrt{N} < d < N : d|N\}. \) Recently, Chentouf characterized all positive integers N such that the set of small divisors \(\{d\le \sqrt{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.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Linear Recurrences of Order at Most Two in Nontrivial Small Divisors and Large Divisors

  • Hùng Việt Chu,
  • Kevin Huu Le,
  • Steven J. Miller,
  • Yuan Qiu,
  • Liyang Shen

摘要

For each positive integer N, define \( S'_N \ =\ \{1 < d < \sqrt{N}: d|N\} \text{ and } L'_N \ =\ \{\sqrt{N} < d < N : d|N\}. \) Recently, Chentouf characterized all positive integers N such that the set of small divisors \(\{d\le \sqrt{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.