This is what I came up with, I only managed to get a code and not an actual equasion to write down. Feel free to test your numbers! Full code at Bottom (py) TL;DR: Explaining my approach, scroll to read conclusions (bold) only, I lack the mathematical skill to use equasions so I have to use word...

I want to demonstrate my way of thinking about 3n+1, or (n-1)/3 Please correct me if I am wrong and help me learn and understand! Introduction: 1st rule: Every number that can be divided by 2, causes (earlier or later) the number to be stuck in the loop. This means we have to prove, that all unev...

Please undelete this answer (by me) https://math.stackexchange.com/a/5017532/41841 I edited it to include the direct answer to the question. It had the equivalent before the deletion too, but in another syntax. Now it includes the result directly, as asked for by the question, which result is a s...

After reading it I have no clear idea if proof from Guy Robin "Sur l’ordre maximum de la fonction somme des diviseurs" or in other similars related to Merten's Theorems (2nd and 3rd) does they depend on the RH or they are really independant from it. So infinite sign change in following expression...