Posted By: Lumo (* Lumidek *) on 'CZscience' Title: Re: Eukliduv algoritmus Date: Wed Apr 16 21:24:05 1997 Ahoj nespokojenci, zatim jsem si myslel, ze Euklidovym algoritmem se mini hledani nejvetsiho spolecneho delitele: mam dve cisla x,y a hledam jejich NSD. Algoritmus spociva v opakovanem nahrazeni vetsiho ze dvou cisel rozdilem vetsiho cisla a (minus) mensiho cisla, dokud nejsou obe stejna, pak udavaji obe NSD. Priklad 180,285: 180,285 -> 180,285-180 = 180,105 -> 105,180-105 = 105,75 -> 75,105-75 = 75,30 -> 75,75-30 = 75,45 -> 45,75-45 = 45,30 -> 30,45-30 = 30,15 -> 15,30-15 = = 15,15 tj. NSD=15. ///// Superstring/M-theory is the language in which God wrote the world. /// O __ Your Lumidek. mailto:motl@karlin.mff.cuni.cz /// --------------------------------------------------- ///_______/ http://www.kolej.mff.cuni.cz/~lumo/ The most incomprehensible thing about the world is that it's comprehensible. AE -------------------------------------------------------------------------------