The modulo (sometimes called modulus) operation finds the remainder of division of one number by another


Multiplication is the mathematical operation of scaling one number by another

Operator higher lower


"It appears that you consider modulo to have lower precedence than multiplication and division when in fact it does not"

from question  

Operator precedence in C explanation

"He line works because of integer division the line works because of modulo;the line works because of operator precedence multiplication has a higher precedence than addition + so it will be done first"

from question  

Why does this loop work?



I have also heard that the complexity of a modulo is usually slightly more than multiplication

from question  

* (no title is found for this review)

Note that is equivalent to i 10 but much faster since modulo is around 10 times slower than multiplication

from question  

The most efficient way to reverse a number

If you want to mimic the original ideal of multiplying by a prime the obvious generalization is to do arithmetic in the galois field gf 2 8 - see and note that you can essentially use log and antilog tables of size 256 to replace multiplication with not much more than table lookup -;arithmetic over a finite field of any sort will have many of the nice properties of arithmetic modulo a prime - arithmetic modulo p is gp p or gf p 1 if you prefer

from question  

Non-commutative combination of two byte arrays

Before this let s examine the myth of sqrt being expensive but a large bunch of multiplication is not;first of all let us note that sqrt is not that expensive anymore on older cpu-es x86 32b it used to be twice as expensive as a division and a modulo is division on newer architectures the cpu costs are equal

from question  

For a given number N, how do I find x, S.T product of (x and no. of factors to x) = N?

Here multiplication done by summation;if modder 1e12 then your modulo not work

from question  

Why this modular GCD fails on large inputs?

Back to Home
Data comes from Stack Exchange with CC-BY-SA-4.0