搜索结果: 1-6 共查到“数学 Cyclotomic polynomials”相关记录6条 . 查询时间(0.062 秒)
Factorization of the Cyclotomic Polynomials Q2^(n+1)(x)
Algebra cyclotomic polynomial order of an integer Factorization theorem
<
2011/9/25
In this paper we study the factorization of the polynomials 1+x^(2^n)over a field K, which have the same form as the Fermat numbers . As we notice that 1+x^(2^n) is equal to the 2^(n+1)th cyclotomic p...
Factorization of the Cyclotomic Polynomials Qp^(n+1)(x)
Algebra cyclotomic polynomial order of an integer Factorization theorem
<
2011/9/25
In this paper we study the factorization of the p^(n+1)th cyclotomic polynomials Qp^(n+1)(x) over a field K for prime p>2 and integer n>=0. Our methodology to solve the problem is due to some conclusi...
Canonical Factorization of cyclotomic polynomials
algebra finite fields order of an integer cyclotomic polynomials factorization
<
2011/9/25
In this article, we studied the order of an integer q modulo integer m, and then studied the factorization of the mth cyclotomic polynomial over a field K. We discussed the order of q modulo m by the ...
Cyclotomic Polynomials and Factorization Theorems
algebra finite fields order of an integer cyclotomic polynomials factorization theorem
<
2011/9/24
Let Qm(x) be the mth cyclotomic polynomial over finite field Fq. The factorization of Qm(x^t) and f(x^t) over Fq are discussed, where t is an positive integer larger than one and f(x) is any irreducib...
On the height of cyclotomic polynomials
cyclotomic polynomial inverse cyclotomic polynomial
<
2011/2/22
Let An denote the height of cyclotomic polynomial Φn,where n is a product of k distinct odd primes. We prove that An "k'(n)k−12k−1 −1 with −log "k c2k, c > 0. The same state...
On explicit factors of Cyclotomic polynomials over finite fields
Cyclotomic polynomials finite fields
<
2010/11/24
We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyc...