Feedback
Got a suggestion for improvement? Anything goes.
Found a bug? Let us know. For other inquries feel free to contact us about anything at all.
Call to action
Depvana's growth is 100% powered by word of mouth. If you want to help: tell a friend! Let your group chats know, let people know of Depvana on other platforms.
Depvana •
about •
legal •
contact •
contribute •
Depvana is independent. Help keep it that way.
© 2024 Depvana aps.
Login to add a hashtag.
Hashtags
Bookmark
Rss
Topic Collatz Conjecture
Public room public room
Moderators •  Beyond
Depth •  Academic disciplines > Mathematics > Collatz Conjecture
Topic DescriptionThe 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 follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that these sequences always reach 1, no matter which positive integer is chosen to start the sequence. The conjecture has been shown to hold for all positive integers up to 2.95 times 10 to the 20, but no general proof has been found. https://en.wikipedia.org/wiki/Collatz_conjecture
No. 203
57
0
1
More
Copy link
Report
Encrypt
Encrypt post text
Encryption Key
Repeat Key
Encrypt
Encrypt post text before posting. Choose an encryption key to encrypt your post with. Be sure to remember this key, as it is the only way to decrypt and view the content again. Only share this key with individuals you want to be able to decrypt your post.
Note that all encryption is performed locally, and no one will be able to recover the content if you lose this key.
Visible to the public Public post
Attachments • images • video webm/mp4 • max size 4096KiB.
Attachments • images • video • max 4MB.