Counting irreducible polynomials over finite fields |
| |
Authors: | Qichun Wang Haibin Kan |
| |
Institution: | 1.The Shanghai Key Lab of Intelligent Information Processing, School of Computer Science,Fudan University,Shanghai,P.R.China |
| |
Abstract: | In this paper we generalize the method used to prove the Prime Number Theorem to deal with finite fields, and prove the following
theorem:
$
\pi (x) = \frac{q}
{{q - 1}}\frac{x}
{{\log _q x}} + \frac{q}
{{(q - 1)^2 }}\frac{x}
{{\log _q^2 x}} + O\left( {\frac{x}
{{\log _q^3 x}}} \right),x = q^n \to \infty
$
\pi (x) = \frac{q}
{{q - 1}}\frac{x}
{{\log _q x}} + \frac{q}
{{(q - 1)^2 }}\frac{x}
{{\log _q^2 x}} + O\left( {\frac{x}
{{\log _q^3 x}}} \right),x = q^n \to \infty
|
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|
|