mod ( n1 n2 -- n3 )

published: 9 January 2022 / updated 16 February 2022

Lire cette page en français

vocabulary: forth

Divide n1 by n2, giving the single-cell remainder n3.

The modulo function can be used to determine the divisibility of one number by another.

Example:

21 7 mod . \ display 0 
22 7 mod . \ display 1 
23 7 mod . \ display 2 
24 7 mod . \ display 3 
 
: DIV? ( n1 n2 ---) 
    OVER OVER MOD CR 
    IF 
        SWAP . ." is not " 
    ELSE 
        SWAP . ." is " 
    THEN 
    ." divisible by " . 
 ;

Legal: site web personnel sans commerce / personal site without seling

WARNING

In our articles, reference is made to different versions of the language FORTH (AmForth, FlashForth, GForth ...).

All of these versions are licensed GNU. Ref: Licence publique générale GNU

So you can download, install, use all these versions on your computer and / or on an ARDUINO card with no transfer of fees and no special conditions.

The GNU/GPL license does not give you the right to monetize the source and executable codes marked under this license.

You are authorized to monetize your own achievements, articles, books if these products are the fruit of your labors.

The GNU / GPL license exploits the principle of sharing and collaboration. If you profit know-how in files marked GNU, reciprocity is expected from you by sharing your achievements, even modest.