Yening kosong nenten taen kejadian, dadosne algoritma polih majalan pinih akeh m − 1 tindak tanpa nganggen sisa lewih saking apisan.
If 0 never occurs, then the algorithm can run at most m − 1 steps without using any remainder more than once.