[plt-scheme] Divisions

[pocm@rnl.ist.utl.pt (Paulo J. Matos)]

Hi all,

I'm implementing extended euclidean algorithm, I wish it to be
fast and I need a way to compute the integer division of a by b
and the division remainder. Is there a way to do it without 2
divisions... (I'm counting that remainder function performs a
division).

Any ideas?

Best regards?

-- 
Paulo J. Matos : pocm(_at_)rnl.ist.utl.pt
Instituto Superior Tecnico - Lisbon    
Software & Computer Engineering - A.I.
 - > http://www.rnl.ist.utl.pt/~pocm 
 ---	
	Yes, God had a deadline...
		So, He wrote it all in Lisp!