Theoretical and computational bounds for m-cycles of the 3n+1-problem (Q4677368): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56069519 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4064/aa117-1-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117023484 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:18, 19 March 2024
scientific article; zbMATH DE number 2169958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theoretical and computational bounds for m-cycles of the 3n+1-problem |
scientific article; zbMATH DE number 2169958 |
Statements
Theoretical and computational bounds for m-cycles of the 3n+1-problem (English)
0 references
20 May 2005
0 references
3x+1-problem
0 references
cycles
0 references
