Wikipedia wrote:

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another (called the modulus of the operation).

Given two positive numbers a and n, a modulo n (often abbreviated as a mod n) is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor.

For example, the expression “5 mod 2” evaluates to 1, because 5 divided by 2 has a quotient of 2 and a remainder of 1, while “9 mod 3” would evaluate to 0, because 9 divided by 3 has a quotient of 3 and a remainder of 0.

redzback wrote:

Wikipedia wrote:

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another (called the modulus of the operation).

Given two positive numbers a and n, a modulo n (often abbreviated as a mod n) is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor.

For example, the expression “5 mod 2” evaluates to 1, because 5 divided by 2 has a quotient of 2 and a remainder of 1, while “9 mod 3” would evaluate to 0, because 9 divided by 3 has a quotient of 3 and a remainder of 0.

https://en.wikipedia.org/wiki/Modulo

PPPDUD wrote:

Link

LXtricityGames wrote:

What does this block do, exactly??

i feel like it has something to do with the

block, am I correct?