论文标题
在莱默的数字字段上的主机问题上
On the Lehmer's totient problem on Number Fields
论文作者
论文摘要
Lehmer的基本问题询问是否存在复合数字$ D $，以便其主机划分$ D-1 $。在本文中，我们将Lehmer在代数数字字段中概括。我们介绍了莱默号的概念。 Lehmer数字被定义为在数字字段的代数整数中遵守Lehmer的问题的自然数。
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number. Lehmer numbers are defined to be the natural numbers which obey the Lehmer's problem in the ring of algebraic integers of a number field.
