# Modularity and Recursive Sequences

**Number Theory**Level pending

The sequence \(a_n\) is defined by

\[\large \begin{cases} a_0=3 \\ a_{n+1}-a_n=n(a_n-1) & \text{for } n \ge 0 \end{cases} \]

Find all positive integers \(m\) such that \(\gcd(m,a_n)=1\) for all \(n \geq 0\). What can the solution set for \(m\) be best described as?