Let $a$ be a p-cycle in $S_p$, and let $b$ be a transposition in $S_p$. Show $S_p$ is generated by $a$ and $b$.

To use in a simpler typographic matter the fact that $p$ is a prime, let us use the symbols $0,1,2,\dots(p-1)$ to be permuted. We have to show that the cycle $c$ and a transposition $$ \begin{aligned} c &= (0,1,2\dots,(p-1))\ ,\\ t &= (0,a)\ ,\ a\ne 0\ ,\ a\in \Bbb F_p\ , \end{aligned} $$ are generating the full permutation group. Let $G$ be the group generated by $c,t$.

We conjugate $t$ with $c$, so all transpositions $(k, k+a)$ are in $G$.

So $(0,a)$, $(a,2a)$, $(2a,3a)$, $\dots$ are in $G$.

We stop the above at the $b$-value, ($b$ is both seen in $\Bbb Z$ and in $\Bbb F_p$, depending on context,) so that $ab=1$ in $\Bbb F_p$.

Now, using $$(0,a), \ (a,2a), \ (2a,3a),\ \dots\ ((b-1)a,1)$$ we can produce iteratively $$(0,a), \ (0,2a),\ (0,3a),\ \dots\ (0,\underbrace{1}_{ba})\ .$$ (For instance, $(0,a)(a,2a)(0,a)=(0,2a)$.) Finally, $c$ and $(0,1)$ are standard generators for the full symmetric group.

$\blacksquare$