Penerapan teorema sisa cina dalam menyelesaikan sistem persamaan linier non homogen dengan algoritma garner

Khoiriyah , Khoiriyah (2003) Penerapan teorema sisa cina dalam menyelesaikan sistem persamaan linier non homogen dengan algoritma garner. Undergraduate thesis, FMIPA UNDIP.

[img]PDF
Restricted to Repository staff only

1597Kb
[img]
Preview
PDF
15Kb
[img]
Preview
PDF
215Kb
[img]
Preview
PDF
316Kb
[img]
Preview
PDF
255Kb
[img]
Preview
PDF
582Kb
[img]PDF
Restricted to Repository staff only

740Kb
[img]
Preview
PDF
208Kb
[img]
Preview
PDF
208Kb

Abstract

Algoritma Gamer bekerja dengan kongruen bilangan bulat modulo m. Bahwasanya algoritma Garner digunakan untuk menyelesaikan masalah sisa Cina yang disajikan dalam teorema sisa Cina. Selanjutnya, algoritma Garner digunakan untuk menyelesaikan sistem persamaan Tinier. Adapun sistem persamaan limier yang dirnaksud adalah yang non homogen dengan konstanta bilangan bulat dan mempunyai penyelesaian tunggal. Gamer Algorithm works with integer congruent of m modulo. The Gamer algorithm used to solve the Chinese remainder problem which is presented in Theorem of Chinese Remainder. Here in after Gamer algorithm used to solve linear equation system. As for such linear equation system which non homogeneous with integer constanta and have unique solution.

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:31630
Deposited By:Mr UPT Perpus 1
Deposited On:23 Nov 2011 15:34
Last Modified:23 Nov 2011 15:34

Repository Staff Only: item control page