In this poster, we give two recurrence sequences of integers, defined by recurrence relations of the form V{n+1}=f(Vn;Tn) and T{n+1}=g(Vn;Tn), which are related to the Collatz conjecture. We show why if we can prove that lim{n → +∞} Vn=0 for all the values (V0;T0) that means Collatz’s conjecture proof. We also try to understand why the Collatz conjecture is a difficult problem.