Home > Science > Mathematics > Number Theory > Open Problems > Collatz Problem
Computational verification of the 3x+1 conjecture Introduction Results References Links Contact Introduction Let x be an integer. Let the function T(x) be equal to (3x+1)/2 if x is odd and equal to x/2 if x is even. The 3x+1 conjecture , asserts that starting from any positive integer n the repeated iteration of T(x) eventually produces the integer 1, after which the iterates will alternate ...
www.ieeta.pt/~tos/3x+1.html
Post a Review
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Please note, all comments are subject to review and can be removed at any time for any reason.
Disclaimer: Galaxy is not affiliated in any way with the 3x+1 conjecture verification results (www.ieeta.pt/~tos/3x+1.html) website.
Views and opinions expressed may not be representative of Galaxy or its owners but all effort is made to keep the site free of obscenities, illegal or otherwise malicious activity.
Are you the owner of this site? You can manage your listing here.