Display title | Collatz conjecture |
Default sort key | Collatz conjecture |
Page length (in bytes) | 58,812 |
Namespace ID | 0 |
Page ID | 200713 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>Jslovo |
Date of page creation | 06:14, 9 March 2024 |
Latest editor | imported>Jslovo |
Date of latest edit | 06:14, 9 March 2024 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. It concerns sequences of integers in which each term is obtained from the previous term as... |