What’s the difference between “mod” and “remainder”?

by

There is a difference between modulus and remainder. For example:

-21 mod 4 is 3 because -21 + 4 x 6 is 3.

But -21 divided by 4 gives -5 with a remainder of -1.

For positive values, there is no difference.

More Related Contents:

  1. What is the "–>" operator in C/C++?
  2. "." or "->" C struct accessor [duplicate]
  3. Logic behind sizeof operator [duplicate]
  4. Not able to calculate in C.How do you calculate in C?
  5. Sum of the all the numbers between a and b [closed]
  6. What does the ??!??! operator do in C?
  7. The most efficient way to implement an integer based power function pow(int, int)
  8. What is short-circuit evaluation in C?
  9. Undefined reference to `sin` [duplicate]
  10. How do I determine the number of digits of an integer in C?
  11. Power by squaring for negative exponents
  12. What does i = (i, ++i, 1) + 1; do?
  13. Explain this snippet which finds the maximum of two integers without using if-else or any other comparison operator?
  14. Using M_PI with C89 standard
  15. Representing integers in doubles
  16. Compute fast log base 2 ceiling
  17. Are floating point operations in C associative?
  18. C – How to implement Set data structure?
  19. C: how to break apart a multi digit number into separate variables?
  20. Why does gdb evaluate sqrt(3) to 0?
  21. How can I calculate divide and modulo for integers in C#?
  22. To the power of in C? [duplicate]
  23. How does this bitwise operation check for a power of 2?
  24. log2 not found in my math.h?
  25. In C, what is the difference between `&function` and `function` when passed as arguments?
  26. How to use % operator for float values in c
  27. Evaluate Mathematical Function from String [closed]
  28. How sqrt() of GCC works after compiled? Which method of root is used? Newton-Raphson?
  29. Does *p++ increment after dereferencing? [duplicate]
  30. Algorithm to pick values from array that sum closest to a target value?

Leave a Comment