One item is filed under this topic.








Mod versus Rem in Turing 
20130101 

From Eric: I am a teacher teaching computer science using Turing. I am having
difficulty understanding why one would use the mod operator versus the rem
remainder operator.
Mod seems to make the resulting sign depend on the sign of the divisor,
whereas rem makes the resulting sign depend on the dividend.
Examples:
11 mod 5 = 1 and 11 rem 5 =1
11 mod 5 = 4 and 11 rem 5 = 1
11 mod 5 = 4 and 11 rem 5 =1
11 mod 5 = 1 and 11 rem 5 = 1
What I can't understand is why this would matter. For example, 11 / 5 =
2.2 and 11 / 5 = 2.2 get the same result.
So how is a remainder dependent on the sign of one of the parts?
What benefit would using one over the other have?
Any insight would be most helpful!
Eric Answered by Harley Weston. 


