arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1308.3754math.NT
收藏

二次多项式的判别式

Discriminators of quadratic polynomials

Soohyun Park

摘要:

给定$f \in \mathbb{Z}[x]$和$n \in \mathbb{Z^{+}}$,$\emph{discriminator}$ $D_f(n)$是最小的正整数$m$,使得$f(1), \ldots, f(n)$是不同的mod $m$。在最近的一篇论文中,Z. W. Sun证明了$D_f(n) = d^{\lceil \log_d n \rceil}$如果$f(x) = x(dx - 1)$为$d \in \{2, 3\}$。我们将这个结果推广到对任何$r \in \mathbb{Z}^{+}$的$d = 2^r$,并发现在这种情况下,$D_f(n) = 2^{\lceil \log_2 n \rceil}$。我们还提供了$d = p^r$的更一般的陈述,其中$p$是素数。此外,我们提出了一个潜在的方法来产生素数与判别多项式并不总是采取素数值。最后,我们描述了一些一般性的声明和可能的研究课题的任意多项式的整数系数的可拓性。

英文摘要:

Given $f \in \mathbb{Z}[x]$ and $n \in \mathbb{Z^{+}}$, the $\emph{discriminator}$ $D_f(n)$ is the smallest positive integer $m$ such that $f(1), \ldots, f(n)$ are distinct mod $m$. In a recent paper, Z.-W. Sun proved that $D_f(n) = d^{\lceil \log_d n \rceil}$ if $f(x) = x(dx - 1)$ for $d \in \{2, 3\}$. We extend this result to $d = 2^r$ for any $r \in \mathbb{Z}^{+}$ and find that $D_f(n) = 2^{\lceil \log_2 n \rceil}$ in this case. We also provide more general statements for $d = p^r$, where $p$ is a prime. In addition, we present a potential method for generating prime numbers with discriminators of polynomials which do not always take prime values. Finally, we describe some general statements and possible topics for study about the discriminator of an arbitrary polynomial with integer coefficients.

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

↑