SAT1000 - P500

Algebra Level pending

$\{a_n\}$ is a sequence such that $a_1=m\ (m \in \mathbb N^+)$, $a_{n+1}=\begin{cases} \dfrac{a_n}{2} ,\ a_n \equiv 0 \pmod{2} \\ 3 a_n+1 ,\ a_n \equiv 1 \pmod{2} \end{cases}$ If $a_6=1$, find the sum of all possible value(s) for $m$.

Have a look at my problem set: SAT 1000 problems

×