Problem:
Any positive integer number can be presented as 1 and several operations *3 and /2 discarding the result after the decimal point when dividing.
for instance:
4 = 1 *3 *3 /2
12 = 1 *3 *3 /2 *3
make code which enters positive integer N then present it with 1 *3 /2 equation.
The rules:
You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday January 19th.
On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC
You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.
olimex 
Jan 19, 2014 @ 02:31:03
You know that this statement is not proven? Its know as a variation of the COllatz conjecture (https://en.wikipedia.org/wiki/Collatz_conjecture ) and one the unsolved mathematical problems.
Jan 19, 2014 @ 15:19:23
Thank you for the link! Unproved? It doesn’t matter,we can develop our programing skill, at least, on brute force method. And maybe somebody sometime… 🙂