摘要
<span style="font-family:Verdana;">The unsolved number theory problem known as the 3</span><i><i><span style="font-family:Verdana;">x</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;"> + 1 problem involves sequences of positive integers generated more or less at random that seem to always converge to 1. Here the connection between the first integer (</span><i><i><span style="font-family:Verdana;">n</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;">) and the last (</span><i><i><span style="font-family:Verdana;">m</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;">) of a 3</span><i><i><span style="font-family:Verdana;">x</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;"> + 1 sequence is analyzed by means of characteristic zero-one strings. This method is used to achieve some progress on the 3</span><i><i><span style="font-family:Verdana;">x</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;"> + 1 problem. In particular, the</span> long<span style="font-family:Verdana;"><span style="font-family:Verdana;">-</span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;">standing conjecture that nontrivial cycles do not exist is virtually proved using probability theory.</span></span>
<span style="font-family:Verdana;">The unsolved number theory problem known as the 3</span><i><i><span style="font-family:Verdana;">x</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;"> + 1 problem involves sequences of positive integers generated more or less at random that seem to always converge to 1. Here the connection between the first integer (</span><i><i><span style="font-family:Verdana;">n</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;">) and the last (</span><i><i><span style="font-family:Verdana;">m</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;">) of a 3</span><i><i><span style="font-family:Verdana;">x</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;"> + 1 sequence is analyzed by means of characteristic zero-one strings. This method is used to achieve some progress on the 3</span><i><i><span style="font-family:Verdana;">x</span></i><span style="font-family:Verdana;"></span></i><span style="font-family:Verdana;"> + 1 problem. In particular, the</span> long<span style="font-family:Verdana;"><span style="font-family:Verdana;">-</span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;">standing conjecture that nontrivial cycles do not exist is virtually proved using probability theory.</span></span>