Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Ulam_conjecture
gptkb:3x+1_problem gptkb:Syracuse_problem |
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:formedBy |
gptkb:Lothar_Collatz
1937 |
| gptkbp:hasMathWorldEntry |
https://mathworld.wolfram.com/CollatzProblem.html
|
| gptkbp:hasProofStatus |
open problem
|
| gptkbp:hasSequenceOEIS |
gptkb:A006577
gptkb:A008908 A020914 |
| gptkbp:hasWikipediaPage |
https://en.wikipedia.org/wiki/Collatz_conjecture
|
| https://www.w3.org/2000/01/rdf-schema#label |
Collatz conjecture
|
| gptkbp:relatedTo |
stopping time
hailstone sequence iterated function total stopping time |
| gptkbp:sentence |
Take any positive integer n. If n is even, divide it by 2. If n is odd, multiply it by 3 and add 1. Repeat the process. The conjecture states that no matter what number you start with, you will always eventually reach 1.
|
| gptkbp:status |
unproven
|
| gptkbp:bfsParent |
gptkb:Unsolved_Problems_in_Number_Theory
|
| gptkbp:bfsLayer |
6
|