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

Similar Threads for: headache about Kollatz algorythm
Thread	Forum	Replies
A ringing headache	Brain Teasers	6
Formula/Algorythm for 06 and 08 Elections	Current Events	5
MCQ thats giving me a headache	Introductory Physics Homework	6
Headache	General Discussion	12
a part of Kollatz problem	Linear & Abstract Algebra	2

FromRussiaWithLove	headache about Kollatz algorythm Tweet 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/messag...tml?1105738023 -- AI