# Approaching a seemingly intractable problem

This is a soft question that questions how to be efficient in approaching a problem that seems intractable to solve.

In particular in abstract algebra, I feel that certain proofs are 'magic'.

When I approach a certain problem I always restrict the methods in the proof that I give to the material that has been discussed in the textbook so far.

However, there are also times that when I see the proof (after trying really hard at attempting) that it seems trivially obvious. I then ask myself how I could have not. thought about that. But then again, I did spend the time in approaching the problem; so if it was so obvious, why didn't I solve it right away?

I'm thinking that I lack some kind of efficiency when approaching problems in abstract algebra but I fail to see how I can improve this substantially.

To give a random example, here is such a question (I'm not looking for an answer to this question, in this post, btw).

Show that the order of any cyclic subgroup of $S_n$ is a divisor of $n!$. (Lagrange's theorem and cosets aren't discussed yet; just the definition of a (sub)group, the sign function and the concept of equivalence classes.)

This post is written in the spirit of the broadest sense of how to approach a certain question efficiently, some times after many (failed) attempts. I may not have formulated the post in the clearest way possible. But then again, this is meant as a soft question.

What I usually do when I'm stuck with a certain question, is reviewing the discussed material and then giving it another go. Some times I search up Wikipedia on the concept, but then I feel that a question is posed to be solved with only the discussed material at hand; so this feels like cheating.

• I am afraid that my immediate reaction to your example is that it would be more efficient and useful to learn Lagrange's Theorem first. But I agree that it is better to avoid using significantly more advanced results to prove elementary results. Mar 15 '16 at 16:45
• It would be helpful if you could highlight what went wrong with your example problem. What thoughts did you have, what theorems were available, what solution did your instructor give? Did you understand the question? Did you see that $n!$ is the order of $S_n$, that the order of a cyclic subgroup is the same as the order of any element generating it? Did the solution use/prove the general result that the order of an element divides the order of a group (if finite), or did it prove it directly for $S_n$ by analyzing the cycle structure of an arbitrary element?
– user169852
Mar 15 '16 at 17:16
• If you had asked how to be efficient in swimming a long distance, I would have said: do a lot of swimming beforehand to build up your swimming muscles. My answer to your question on how to be efficient in approaching a mathematical question is actually pretty much the same: do a lot of mathematical problems beforehand to build up your mathematical muscles. Mar 15 '16 at 17:17
• Your example is basically the problem of developing some of the basic theory of groups (subgroups, cosets, Lagrange's theorem) on your own in order to give a proof. I'm not surprised that it wasn't easy. Mar 15 '16 at 17:39

Step 1 (Understand the problem): What is a subgroup? What is a cyclic group? What is the symmetric group $S_{n}$? What do cyclic subgroups of $S_{n}$ "look like"? How do you intuitively "see" the elements in $S_{n}$? Do you intuitively "perceive" the elements in $S_{n}$ as permutations written in disjoint cycle form? As permutation matrices? As (bijective) functions on $\{ 1, 2, \ldots, n \}$?