Some Irreducible Polynomials Over a Finite Field
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i2.5996Keywords:
Polnomial, irreducible polynomial, Finite field, divisibility,, divisibility criteria.Abstract
The irreducibility of a polynomial over a finite field refers to whether the polynomial, with coefficients in that field, cannot be factored into nontrivial polynomials. It is surprising to discover that there exist very efficient but still little-known divisibility criteria. In this paper, we give some irreducibility criterions of a given polynomial with coefficients in $\mathbb{F}_{q}[X]$, were $\mathbb{F}_{q}$ is a finite field. The arguments can be extended to discuss our results, including potential applications or future research directions.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Amara Chandoul, Abdallah Assiry
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.