콜라츠 추측(3n+1 문제)을 시각적으로 탐색합니다. 100% 무료.
콜라츠 추측(임의의 양의 정수에 3n+1 또는 n/2를 반복)을 시각화하는 도구입니다.
The Collatz conjecture, proposed by Lothar Collatz in 1937, asks whether repeating two simple arithmetic operations — dividing even numbers by 2 and multiplying odd numbers by 3 and adding 1 — will eventually reach the number 1, regardless of the starting positive integer. Despite extensive computational verification for very large numbers, no general proof has been found.
The number with the most total stopping time found so far is around 2^68. The sequence for 27 is a famous example — it takes 111 steps and reaches a peak of 9,232 before finally reaching 1.
이 도구는 어떻게 사용하나요?
내 데이터는 안전한가요?