This research delves into the extensive analysis of symmetric groups of various orders and degrees. We explore different representations of permutations, construct a Cayley table for the symmetric group of degree four, and systematically identify all its subgroups using Lagrange's theorem. An intriguing discovery unfolds as we demonstrate that the converse of the theorem countered by Sylow's theorem does not hold universally. Furthermore, we apply the concepts of permutations and product of disjoint cycles to address a real-world problem – the Card Trick game. This study amalgamates theoretical exploration with practical applications, showcasing the versatility and depth of symmetric group theory.