Modulo
Overview
Modulo takes two Numerical Type Inputs; a
(the dividend) and b
(the divisor) and returns the remainder of the division of a
and b
.
Unlike normal division, this kind of operation, actually considers how many times the divisor fits into the dividend in its entirity (the quotient), with the remainder being the amount that is left over.
Dividend ( | Divisor ( | Quotient | Remainder ( |
10 | 25 | 2 | 5 |
5.5 | 1.5 | 3 | 1 |
540 | 360 | 1 | 180 |
15 | 12 | 1 | 3 |
Attributes
Attribute | Type | Description |
---|---|---|
| Defined in the | The Numerical Data Type of both the dividend and the divisor ( |
Inputs
Input | Type | Description |
---|---|---|
Pulse Input (►) | Pulse | A standard Input Pulse, to trigger the execution of the Node. |
| Defined in the | The dividend (number to be divided). |
| Defined in the | The divisor (amount the dividend should be divided by). |
Outputs
Output | Type | Description |
---|---|---|
Pulse Output (►) | Pulse | A standard Output Pulse, to move onto the next Node along the Logic Branch, once this Node has finished its execution. |
| Defined in the | The remainder of the division operation. (divisor - dividend * quotient). |
External Links
Intro to remainders on Kahn Academy.
What is modular arithmetic? on Kahn Academy.
Last updated