the 'a' is your number & 'b' is the divisor & the result is the remainder.
so 7 mod 3 = 1
hope this helps
-Buzz
At 10:05 AM -0700 7/16/01, Irv Kalb wrote:
>If you are using integers, use the "mod" function, as in
>
> if (a mod b) = 0 then
> -- divisible
> else
> -- not evenly divisible
> end if
>
>Irv
>
>At 12:50 PM -0400 7/16/01, Bill Numerick wrote:
>>Hey All,
>>
>>How can I find out if something is divisable by a certain number?
>
>--
>
>Lingo / Director / Shockwave development for all occasions.
> (Home-made Lingo cooked up fresh every day just for you.)
>
>[To remove yourself from this list, or to change to digest mode, go to
>http://www.penworks.com/LUJ/lingo-l.cgi To post messages to the list,
>email [EMAIL PROTECTED] (Problems, email [EMAIL PROTECTED])
>Lingo-L is for learning and helping with programming Lingo. Thanks!]
[To remove yourself from this list, or to change to digest mode, go to
http://www.penworks.com/LUJ/lingo-l.cgi To post messages to the list,
email [EMAIL PROTECTED] (Problems, email [EMAIL PROTECTED])
Lingo-L is for learning and helping with programming Lingo. Thanks!]
