mod dif dif dif mod dif dif dif
32 1 2 3 32 1 2 3
0 0
21 21
21 20 21 28
41 16 49 16
30 36 6 44
77 16 93 16
11 52 3 60
129 16 153 16
12 68 28 76
197 229
17 1
multiplier A = 5 multiplier A = 13
constant, C = 21 constant C = 21
Figure 5 shows two different Ax + C MOD 32 number
sequences with a potency of 2. Differencing
techniques are used to determine what polynomial would
duplicate these sequences. For the first sequence the
formula would be:
x = ( ( n*(49 + n*(6 + n*8) ) ) / 3 ) mod 32
n = 0, 1, 2, ...
For the second sequence the formula is
x = ( ( n*(37 + n*(18 + n*8) ) ) / 3 ) mod 32
n = 0, 1, 2, ...