arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.0131math.NT
收藏

关于$a^n \pm b^n$被$n$的幂整除

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

Salvatore Tringali

摘要:

当$k$是$a$和$b$的最大值时,我们确定正整数的所有三元组$(a,b,n)$,使得$a$和$b$是互质的,并且$n^k$整除$a^n + b^n$(分别为$a^n - b^n$)(事实上,我们回答了一个稍微更一般的问题)。作为一个副产品,它被发现,对于$m, n \in \mathbb N^+$与$n \ge 2$,$n^m$除$ m^n + 1$当且仅当$(m,n)=(2,3)$或$(1,2)$,这概括了从1990年和1999年版的国际数学奥林匹克的问题。这些结果与K. Gybirry和C. Smyth关于集合$R_k^\pm(a,b) := \{n \in \mathbb N^+: n^k \mid a^n \pm b^n\}$的有限性,当$a,b,k$是固定整数,且$k \ge 3$,$\gcd(a,b) = 1$和$|ab| \ge 2$ .

英文摘要:

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ő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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑