Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Collatz_conjecture
|
| gptkbp:category |
unsolved problems in mathematics
integer sequences |
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:formedBy |
gptkb:Lothar_Collatz
1937 |
| gptkbp:hasUnsolvedProblems |
true
|
| https://www.w3.org/2000/01/rdf-schema#label |
Syracuse problem
|
| gptkbp:namedAfter |
gptkb:Syracuse,_New_York
|
| gptkbp:relatedConcept |
gptkb:3x+1_problem
hailstone sequence |
| 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 is that no matter what number you start with, you will always eventually reach 1.
|
| gptkbp:bfsParent |
gptkb:Collatz_conjecture
|
| gptkbp:bfsLayer |
7
|