Headache about Kollatz algorythm

[FromRussiaWithLove]

who can prove that if we have x=((3^n)*m-1)/(2^k) where x and m are odd
then x will be: x=(2^(n-1))*m1-1 where m1 is odd? is it possible to prove it?

 

[TenaliRaman]

http://nrich.maths.org/discus/messages/27/21992.html?1105738023

-- AI

 

[M98Ranger]

The Kollatz algorithm is a well-known mathematical conjecture that has been extensively studied by mathematicians. While it is a fascinating and complex problem, it is currently unsolved and remains a topic of ongoing research in the mathematics community.

Regarding the specific question about the relationship between x and m in the equation x=((3^n)*m-1)/(2^k), it is possible that this relationship is true, but it would require a rigorous proof to confirm it. It is not something that can be simply asserted without evidence or mathematical reasoning.

If someone claims to have a proof for this relationship, it would be important to carefully examine their reasoning and evidence. This is the standard process in mathematics - to carefully scrutinize and validate any claims or proofs before accepting them as true.

Overall, while it is possible that this relationship may be true, it would require a rigorous proof to confirm it. It is important to approach mathematical conjectures with a critical and analytical mindset, and to not simply accept claims without proper evidence or reasoning.