The idea of finding redundancy algorithm

To find the remainder example:

The remainder of 120650206 divided by 11

Solution Idea:

The first step: 120650206/11=10968200.54545 ...

The second step: the upper-type result is rounded down, that is, the number directly after the decimal point, that is, 10968200

Step three: Multiply the number obtained after rounding down by 11, i.e. 10968200*11=120650200

Fourth step: Subtract the dividend and take the absolute value with the above result, namely |120650200-120650206|=6

is the LabVIEW implementation program for (120650206+4)%11+1:

Note: Own a little idea ~ ~ ~ Low-level don't laughed at!

The idea of finding redundancy algorithm