should i dump the lean proof here anonymously?
>>17052729No, just say whether or not it's true or false. I will take your word for it.
>>17052732it's true, though i think that's pretty obvious
>>17052729for some inexplicable reason i believe you. what the hell. dump the lean proof
>>17052729What's lean?
>>17052772drugs
>>17052729post it before non-anonymous steals it
coming up soon
>>17052857hurry up nigger
>>17052733 neat thanks for sharing
>>17052772my body. wanna see?
>>17052733Thx anon, so good to know after all these years.
>>17052729Yes.And use a cryptographic signature to avoid the ritalin abusers from taking credit.
>>17052733>Theorem: every orbit of the Collatz map reaches 1>Proof: Follows obviously from the definition
Until OP comes with his revelation I have some question s.It seems to be that each node has at least one but maximum two incoming nodes, and a single outgoing node with the exception of node 1. Or have I overlooked something?
>>170530431 has one income node and one outgoing node, because 4-2-1-4 is the known cycle
>>17052729It's undecidable, there is no proof. See the work of Conway.
>It's true.>Proof: Prove me wrong. You can't.
>>17053060It might be algorithmically undecidable but that's not to say there isn't some known or unknown mathematical device which can assert its truth or untruth.
The short answer is Yes
