Aristiyani, Diah (2009) PENERAPAN ”ALGORITMA EUCLID YANG DIPERLUAS” PADA PENENTUAN FAKTOR PESEKUTUAN TERBESAR ELEMEN RING POLINOMIAL. Other thesis, University of Muhammadiyah Malang.
|
Text
PENERAPAN.pdf - Published Version Download (109kB) | Preview |
Abstract
Polynomial is summary of finite quarter which every quarter is multiply of the real number element with degrees of x. The set of polynomials is called set polynomials. Based on the characters whose the set of polynomials, it’s caused that polynomial make a ring and it’s called polynomials rings and denoted by. Euclid algorithm is one of algorithm which can used to find the greatest common divisor of the real number. This algorithm is used too in finding the greatest common divisor of two polynomials when that’s polynomials is element of polynomials rings. Beside it, the extended euclid algorithm is one of algorithm that can make the greatest common divisor of two polynomials become Firstly, the implementation of the extended euclid algorithm is use the process of euclid algorithm to find the greatest common divisor of two polnomials. Then that process is continued with the opposite of euclid algorithm process. So, from that process we have
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | L Education > L Education (General) |
| Divisions: | Faculty of Teacher Training and Education > Department of Mathematics Education (84202) |
| Depositing User: | Anwar Jasin |
| Date Deposited: | 02 Apr 2012 02:56 |
| Last Modified: | 02 Apr 2012 02:56 |
| URI : | http://eprints.umm.ac.id/id/eprint/1516 |
Actions (login required)
 |
View Item |
