the cyclic sieving phenomenon is a decade-old object in enumerative combinatorics introduced by reiner, stanton, and white related to counting the fixed-point set sizes associated with a finite cyclic group acting on a finite set. we will give examples of the csp for combinatorial actions on young tableaux, polygon dissections, and set partitions. we will see that, while the statement of the csp is purely enumerative, the ``best" proofs of csps are algebraic and instances of the csp can predict results in algebra and geometry.