Eurasian Journal of Mathematical Theory and Computer Sciences 5-jild 3-son (2025) · 27–30-betlar

EISENSTEIN'S CRITERION FOR CHECKING IRREDUCIBLE POLYNOMIALS

Bulakova, Feruza, Farhodova, Gulnoza

DOI: 10.5281/zenodo.15221206 · Manbada o'qish → · PDF (manba serverida)

Annotatsiya

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.

Polynomials, irreducible polynomials, Eisenstein's criterion, equivalent polynomials, canonical form of a polynomial.Ko‘phadlar, keltirilmaydigan ko‘phadlar, Eyzenshteyn alomati, ekvivalent ko‘phadlar, ko‘phadning kanonik yoyilmasi.

Metadata manbasi: jurnal OAI-PMH arxivi · Sindex to'liq matnni saqlamaydi, manbaga havola beradi.