根据封闭式原理，整型后的公式只要初始值不取0，则迭代结果〖 z〗_k∈

According to the closed-form principle, as long as the initial value of the integer formula does not take 0, the iteration result will be [z〗_k∈[1,2a-1], a=2^(L-1), (L is the computer word length) , When L=32, the minimum period after integer is 14448. Equation (2) only involves simple modular addition, modular subtraction and cyclic displacement operations, which can be completed on the nodes.

According to the closed principle, as long as the initial value of the formula after the integer does not take 0, then the iteration result "z" _k∈, a is 2 s (L-1), (L is the length of the computer word), when L is 32, the minimum period after the integer is 14448. Formula (2) involves only simple die-plus, die-subtraction, and circular displacement operations, which can be done on the node.

According to the principle of closed form, as long as the initial value of the integral formula is not 0, the iteration result [Z]_ K ∈ [1,2a-1], a = 2 ^ (L-1), (L is the word length of computer), when l = 32, the minimum period after integer is 14448. Formula (2) only involves simple modular addition, modular subtraction and cyclic displacement operations, which can be completed on nodes.<br>