Intereting Posts

Closed form of $\int_0^\infty \frac{dt}{\left(i t\sqrt{3}+\ln(2\sinh t)\right)^2}$
What initial value do I have to take at the beginning?
Are values in a probability density function related to standard deviation?
Primes for which $x^k \equiv n \pmod{p}$ is solvable
Proof of $(a+b)^{n+1}$
The intersection of two parallel lines
Prove or disprove: For $2\times 2$ matrices $A$ and $B$, if $(AB)^2=0$, then $(BA)^2=0$.
Practical applications of first order exact ODE?
Find a graph on eight vertices with a pair of pseudosimilar vertices
understanding integration by change of variables
Sum of slowly varying functions
A tiling puzzle/question
Eigenvalues of a rectangular matrix
Intuitive explanation of Cauchy's Integral Formula in Complex Analysis
Is following contradictory? Can you give an example?

One can prove that the $\Phi_n(x)$ are irreducible over $\Bbb Z$. Where $\Phi_n(x)=\prod _{(a,n)=1}\zeta_n^a$ (i.e the product of the primitive n-rooth of unity). I want to find a factorization of $\Phi_n$ in $\Bbb F_p$. I proved that all the irreducible factors of $\Phi_n$ over $\Bbb F_p$ are of the same degree, and the degree of all of them is $d$. Where $d$ is the order of $p \in \Bbb Z_n^*$. And since $ Degree (\Phi_n ) = \phi(n) $, then $\Phi_n$ is a product of $ \frac{\phi(n)}{d}$ irreducible factors of degree $d$. To find an explicit factorization , one way is to put a system of equations to find the coefficients of the irreducible factors, but I think that it’s very complicated.

I want to know if there is one way to do this, maybe considering what I said but more. Maybe some relation in the irreducible factors, would reduce the system or something like that.

- Degree of field extension $F(x) / F(x^2 + 1 / x^2)$
- Galois Groups of Finite Extensions of Fixed Fields
- Algebraic Property inherited by a “lift”?
- Let $K$ be a field and $f(x)\in K$. Prove that $K/(f(x))$ is a field if and only if $f(x)$ is irreducible in $K$.
- A finite field extension $K\supset\mathbb Q$ contains finitely many roots of unity
- Algebraic closure for $\mathbb{Q}$ or $\mathbb{F}_p$ without Choice?

- Probability and Data Integrity
- Matrix multiplication using Galois field
- Does $\mathbb{F}_p((X))$ has only finitely many extension of a given degree?
- How (possibly) many subfields does $\mathbb{F}$ has that extend $\mathbb{Q}$?
- Computing a uniformizer in a totally ramified extension of $\mathbb{Q}_p$.
- How to transform a general higher degree five or higher equation to normal form?
- Why aren't there any coproducts in the category of $\bf{Fields}$?
- BIG Intermediate fields in an infinite tower
- How to solve polynomial equations in a field and/or in a ring?
- Finitely generated field extensions

Those factorisations follow the factorisation of $\Phi_n$ on intermediate fields between $\mathbb Q$ and $\mathbb Q(\zeta_n)$.

For example, let $n=12$. There are $4$ cases :

If $p = 1 \pmod {12}$, then $\Phi_{12}$ splits in $\mathbb F_p$, so you have to find one primitive root of $1$, $\zeta_{12}$, then write $\Phi_{12}(X) = (X- \zeta_{12})(X- \zeta_{12}^5)(X- \zeta_{12}^7)(X- \zeta_{12}^{11})$

If $p = 5 \pmod {12}$, then it has the same factorisation as the one on $\mathbb Q(i)$, which is $(X^2-iX-1)(X^2+iX-1)$, so you only need to find one of the two square roots of $ -1$ in $\mathbb F_p$ to get the factorisation.

If $p = 7 \pmod {12}$, then it has the same factorisation as the one on $\mathbb Q(j)$, which is $(X^2-j)(X^2-j^2)$, so you only need to find one of the two primitive third roots of $1$ in $\mathbb F_p$ to get the factorisation.

If $p = 11 \pmod {12}$, then it has the same factorisation as the one on $\mathbb Q(\sqrt 3)$, which is $(X^2-\sqrt 3 X + 1)(X^2+ \sqrt 3 X + 1)$, so you only need to find one of the two square roots of $3$ in $\mathbb F_p$ to get the factorisation.

In any case, finding those factorisations mean that you have to solve some algebraic equations in $\mathbb F_p$ (they are not always simple roots for example if $n=7$ you may have to find $\cos(2\pi/7)$ which is a root of a degree $3$ equation while it’s not a cube root), and in some cases, you have to find one primitive $n$th root of $1$ root in $\mathbb F_p$.

I don’t think there’s a big leap in difficulty in simply finding one primitive root $\zeta_n$ in $\mathbb F_{p^d}$ and then computing the irreducible factors which are all the $(X- \zeta_n^k)(X – \zeta_n^{kp}) (X – \zeta_n^{kp^2})\ldots (X – \zeta_n^{kp^{d-1}})$

- Frobenius Inequality Rank
- Question about $4$-manifolds and intersection forms
- $K(u,v)$ is a simple extension of fields if $u$ is separable
- How complicated is the set of tautologies?
- Cube roots modulo $p$
- Show that $f$ is convex if and only if $f\left( \sum_{i=1}^m\lambda_ix_i \right) \leq \sum_{i=1}^m\lambda_if(x_i)$
- Spectrum of $\mathbb{Z}^\mathbb{N}$
- Simplify $\int \frac{1}{\sqrt{2-x^2}}\, dx$
- Why $\sum_{k=1}^{\infty} \frac{k}{2^k} = 2$?
- Points of continuity of a function being dense
- Norm for pointwise convergence
- How to show that $L^p$ spaces are nested?
- Complexity of verifying proofs
- If $X$ is compact and $f:X\to\mathbb{R}$ is continuous, then $f$ attains the values $\inf\{f(x):x\in X\}$ and $\sup\{f(x):x\in X\}$
- How Old Are Children?