Recent content by 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?

yes, if it is possible. working on that problem I found in what situation the power of two is one, but it is inly a part of answer. The table of power of two for different m and n is very interesting: n 1 2 3 4 5 m 1 1 3 1 4 1<-- the power of 2 for different m and n 3 3 1...

working on Kollatz problem (3x+1 problem) I faced with enother hard problem on number theory. the problem is: we have a number k that is: k=m*(3^n)-1 where m is odd and m>0, n>0, m and n are integers we can see that k is even and if we will divide k on 2^x we will...