VERIFICATION OF IRREDUCIBLE POLYNOMIAL BY USING GENERALIZATION EISENSTEIN CRITERION IN MATLAB GUI AND MIZAR
Technology plays an important role in the development of education to prepare students to respond to global challenges. Each student is expected to have the skills to be able to adapt to technological sophistication. One of these skills is programming. In the process of preparing students for the...
Saved in:
Main Author: | Reinaldy Christianto, Leonardus |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/70496 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Constructing irreducible polynomials over finite fields
by: Ling, San, et al.
Published: (2013) -
An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial
by: Kaminski, Michael, et al.
Published: (2013) -
Irreducible T-modules with endpoint r, and the Q-polynomial property
by: Bautista, Paolo Lorenzo Y.
Published: (2022) -
Pengantar Pemodelan Statistik Menggunakan Gui Matlab
by: Soenarnatalina M., NIDN. 0025126011
Published: (2012) -
GRAPHICAL USER INTERFACE (GUI) OF MATLAB FOR PHYSICS LEARNING
by: guspita, Nela