EISENSTEIN'S CRITERION FOR CHECKING IRREDUCIBLE POLYNOMIALS

Article Sidebar

PDF (Uzbek (latin))
Issue: Vol. 5 No. 3 : Eurasian Journal of Mathematical Theory and Computer Sciences
Section: Articles
Published:

Main Article Content

Sharof Rashidov nomidagi Samarqand davlat universiteti matematika fakulteti
bulakovamath@mail.ru
Sharof Rashidov nomidagi Samarqand davlat universiteti matematika fakulteti
farxodovagulnoza01@gmail.com

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:

Article Details

How to Cite:

Bulakova , F. ., & Farhodova , G. . (2025). EISENSTEIN’S CRITERION FOR CHECKING IRREDUCIBLE POLYNOMIALS. Eurasian Journal of Mathematical Theory and Computer Sciences, 5(3), 27–30. Retrieved from https://www.in-academy.uz/index.php/EJMTCS/article/view/49167

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.