Order is the first question
Permutation and combination problems can use the same numbers while asking for different counts. A permutation counts arrangements where order matters. A combination counts groups where order does not matter. Choosing president, vice president, and treasurer from a club is ordered because the roles are different. Choosing three people for the same committee is unordered because the group is the same no matter how the names are listed.
If the wording says arrange, rank, schedule, code, lineup, or assign roles, order probably matters. If it says choose, select a group, form a committee, or draw a hand, order may not matter. The calculator depends on that reading before any factorial expression is useful.
n is the pool and r is the selection
The value n should describe how many items are available. The value r should describe how many are chosen. If r is larger than n in a no-repetition setting, the setup usually does not make sense. Before calculating, write a short sentence: choose r items from n available items. That sentence catches many reversed entries.
For example, selecting 4 books from 12 means n is 12 and r is 4. Entering those values backward changes the question into selecting 12 items from 4, which is not the same situation. A one-line description protects the setup from that quiet reversal.
Factorials grow faster than intuition
Counting formulas often use factorials, and factorials grow quickly. Ten factorial is already 3,628,800. This is why a small-looking selection problem can produce a very large count. The calculator is useful because it avoids expanding every factorial by hand, but the setup still has to match the story.
Large counts are not automatically mistakes. A short password, a seating arrangement, or a license-style code can create many possibilities. The question is whether the formula matched the rules about order, repetition, and available choices.
Passwords and codes need special care
Some code problems allow repeated characters, while others do not. Some care about order, while others only care about which symbols appear. A four-character PIN usually allows order to matter. A hand of cards usually ignores order. If repetition rules are not stated, do not assume them silently.
A PIN like 1123 is possible only when repetition is allowed. A committee cannot normally choose the same person twice. Those real-world details decide the count before the calculator sees n and r.
Counting often feeds probability
Permutation and combination counts frequently become probability inputs. The count of favorable selections may be divided by the count of all possible selections. Once the counting part is finished, the Probability Calculator can handle the probability step with the counts already clarified.
A smaller example can verify the method
If the formula choice feels uncertain, test the same logic on a tiny example. Choose 2 letters from A, B, and C. Ordered selections produce AB, AC, BA, BC, CA, and CB. Unordered selections produce AB, AC, and BC. That small list shows exactly why permutations and combinations differ by more than vocabulary.