n(n1)/2 is an odd number, ×2×112nn1n(n1)/21, 2n1(n1)/4 is an even number, divide by 22×112nn1n(n1)/21

Continue with the two situations, if it is an even number, if it is an odd number, if it is an even number, cycle 1, 2, (anyway, the number is decreasing when it is an even number)

, until 2n1(n1)/4 is an odd number. Transform to n(n1)(n1)/4

Because: n is an odd number, n1 is an even number, and only (n1)/4 is an even number, nn1(n1)/4 can be an odd number.

............................

............................

............................

n2(n1)(n1)/4(n1)/8 is an odd number, ×2×11

2n4(n1)(n1)/2(n1)/4n2(n1)(n1)/4(n1)/81

10n8(n1)/8, which is an even number, divided by 25n4(n1)/16

n4(n1)(n1)/16

Infinite loop until (n1)/2 gets x power = 1

The proof is now complete.

For every positive integer, if it is an odd number, multiply it by 3 and add 1. If it is an even number, divide it by 2, and so on, you can eventually get 1. This conjecture is completely correct.

Li Mo put down the pen in his hand and closed his eyes. He felt the storm of wisdom rolling in his mind, and a power deep in his soul was slowly awakening.
Chapter completed!