On the divisibility of $a^n \pm b^n$ by powers of $n$

TL;DR

This paper characterizes all positive integer solutions where powers of n divide sums or differences of powers of coprime integers, extending classical Olympiad problems and addressing a conjecture on the finiteness of certain divisibility sets.

Contribution

It provides a complete classification of triples (a, b, n) satisfying divisibility conditions and relates these to a conjecture on the finiteness of specific sets of solutions.

Findings

Identifies all triples (a, b, n) with divisibility conditions.

Shows that n^m divides m^n + 1 only for (m, n) = (2, 3) or (1, 2).

Connects results to a conjecture on the finiteness of sets R_k^ extpm(a,b).

Abstract

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general question). As a by-product, it is found that, for $m, n \in \mathbb N^+$ with $n \ge 2$, $n^m$ divides $ m^n + 1$ if and only if $(m,n)=(2,3)$ or $(1,2)$, which generalizes problems from the 1990 and 1999 editions of the International Mathematical Olympiad. The results are related to a conjecture by K. Gy\H{o}ry and C. Smyth on the finiteness of the sets $R_k^\pm(a,b) := \{n \in \mathbb N^+: n^k \mid a^n \pm b^n\}$, when $a,b,k$ are fixed integers with $k \ge 3$, $\gcd(a,b) = 1$ and $|ab| \ge 2$.