I think I made it worse :(

How about:

Do you know Collatz conjecture? Click here, You can read some details..

Given the following algorithm

If number x is even, x = x / 2
else if x is odd, x = x * 3 + 1

Find all the numbers which resolve to a specified number (y) when the algorithm is applied a specified number of times (n).

Sort the results in ascending order.

For example:

Find all the numbers which resolve to 1 (y = 1) after 5 applications of the algorithm (n = 5).
(in accordance with the rules of the Collatz conjecture)

reversalCollatz(5,1) === [4,5,32] 

4 -> 2 -> 1 -> 4 -> 2 -> 1

5 -> 16 -> 8 -> 4 -> 2 -> 1

32 -> 16 -> 8 -> 4 -> 2 -> 1

try http://i1044.photobucket.com/albums/b450/goofballlogic/nimbus-image_zpscx3jctwp.png ?

I added some suggestions here: http://nimb.ws/wxWYl6 (links to google drive image)

Formatting of the description is very hard to grok. Need to work on presentation.

Going to not complete this on purpose :) Bad kata i think.