EISENSTEIN'S CRITERION FOR CHECKING IRREDUCIBLE POLYNOMIALS
Vol. 5 No. 3 (2025): Eurasian Journal of Mathematical Theory and Computer Sciences 27-30
Abstract
In this paper, we considers Eisenstein's criterion for proving that polynomials are irreducible polynomials. A detailed proof of Eisenstein's criterion and examples show that polynomials are irreducible polynomials.
Keywords:
References
Usanov, M.M. (2023). Kompleks sonlar maydoni ustidagi ko‘phadlar va ularni keltirilmaydigan ko‘paytuvchilarga yoyish. Eurasian journal of mathematical theory and computer sciences, 1.
Yunusova, D.I., Yunusov, A.S. (2007). Algebra va sonlar nazariyasi. Toshkent: Ilm ziyo.
Ayupov, Sh.A., Omirov, B.A., Xudoyberdiyev, A.X., Haydarov, F.H. (2019). Algebra va sonlar nazariyasi. Toshkent: Tafakkur bo‘stoni.
Kurosh, A.G. (1976). Oliy algebra kursi. Toshkent: O‘qituvchi.
Narzullayev, U.X., Soleyev, A.S., Ro‘zimurodov, X.X. (2019). Algebra va sonlar nazariyasidan masala va mashqlar. 2-qism. Samarqand: SamDu nashri.
Readership
Downloads
Published
Issue
Section
How to Cite
