in reply to Re^2: Find if a number is a multiple of a number.
in thread Find if a number is a multiple of a number.

The docs: from perlop
Binary "%" computes the modulus of two numbers.Given integer operands $a and $b: If $b is positive, then "$a % $b" is $a minus the largest multiple of $b that is not greater than $a. If $b is negative then "$a % $b" is $a minus the smallest multiple of $b that is not less tha +n $a (i.e. the result will be less than or equal to zero). Note that when "use integer" is in scope "%" gives you direct access to the mod- ulus operator as implemented by your C compiler. This operator is not as well defined for negative operands, but it will execute faster.
Boris

Replies are listed 'Best First'.
Re^4: Find if a number is a multiple of a number.
by blazar (Canon) on Mar 03, 2005 at 13:59 UTC
    Binary "%" computes the modulus of two numbers.Given integer operands $a and $b: If $b is positive, then "$a % $b" is $a minus the largest multiple of $b that is not greater than $a. If $b is negative then "$a % $b" is $a minus the smallest multiple of $b that is not less than
    And... so what?
    $a (i.e. the result will be less than or equal to zero). Note that when "use integer" is in scope "%" gives you direct access to the mod- ulus operator as implemented by your C compiler. This operator is not as well defined for negative operands, but it will execute faster.
    Is this the particular point on which you meant to draw the attention? If so, then it actually is a good point, however IMHO it belongs more to the realm of side notes...