Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!feeder.erje.net!eu.feeder.erje.net!weretis.net!feeder1.news.weretis.net!news.szaf.org!news.gnuher.de!rz.uni-karlsruhe.de!feed.news.schlund.de!schlund.de!news.online.de!not-for-mail From: Bernd Paysan Newsgroups: comp.lang.forth Subject: Re: Moving 2/ from assembler to loadable extension Date: Wed, 19 Jun 2013 15:09:39 +0200 Organization: 1&1 Internet AG Lines: 21 Message-ID: References: <51b5de45$0$620$e4fe514c@dreader34.news.xs4all.nl> <2013Jun11.145241@mips.complang.tuwien.ac.at> <525c52fd-6658-485f-b409-c5534442ba64@2g2000yqr.googlegroups.com> <2013Jun17.180438@mips.complang.tuwien.ac.at> NNTP-Posting-Host: p5dcd76d5.dip0.t-ipconnect.de Mime-Version: 1.0 Content-Type: text/plain; charset="ISO-8859-1" Content-Transfer-Encoding: 7Bit X-Trace: online.de 1371647379 25369 93.205.118.213 (19 Jun 2013 13:09:39 GMT) X-Complaints-To: abuse@einsundeins.com NNTP-Posting-Date: Wed, 19 Jun 2013 13:09:39 +0000 (UTC) User-Agent: KNode/4.10.3 Xref: csiph.com comp.lang.forth:23797 rickman wrote: > I haven't waded through the document as yet. Anyone care to save me the > effort with an 18 word summary? In Euclidean division, the remainder is always positiv. For all integer division algorithms, a/b = q,r the equation a = b*q + r holds true. -- Bernd Paysan "If you want it done right, you have to do it yourself" http://bernd-paysan.de/