Original Slope diagram. Not a frame copied from the source video.
Original Slope diagram. Not a frame copied from the source video.
Open full-size diagram ↗
WHAT THE SOURCE COVERS

The selected caption section interprets factorial divisibility and uses a counterexample for a must-hold claim. The examples below are original and state exactly when a common-divisor argument is sufficient.

01

A large product can hide a small question

A factorial such as twelve factorial is a compact name for a product, not an instruction to calculate a large decimal integer immediately. If the question concerns divisibility, a trailing zero or a ratio of factorials, most of that product may be irrelevant. Expand only the factors that survive cancellation or contribute the prime you need. This preserves exact arithmetic and makes the mathematical reason visible. A large numerical value is often a distraction from a much smaller factor inventory.

02

Cancel an overlap before multiplying

Consider eight factorial divided by six factorial. The factors one through six appear in both numerator and denominator and cancel, leaving seven times eight, or fifty-six. In contrast, eight factorial divided by the product of six factorial and two factorial is twenty-eight, because the extra divisor two must remain. These expressions differ by a small symbol but describe different counts. Write the denominator in full before canceling so that a factor from a separate product is not silently discarded.

03

Count the prime that limits trailing zeros

Every trailing decimal zero needs a factor ten, hence one factor two and one factor five. In a factorial, twos are more plentiful than fives, so the fives determine the number of trailing zeros. For thirty factorial, multiples of five contribute six fives. Twenty-five contributes an additional five because it contains five squared. There are no multiples of 125 in the product. The total is seven trailing zeros. Counting only the multiples of five would miss the second contribution from twenty-five.

04

Extend the count without double counting

For fifty factorial, there are ten multiples of five and two multiples of twenty-five. Counting one five from each of the first group and one extra five from each of the second gives twelve. A multiple of twenty-five intentionally appears in both counts because it supplies at least two factors of five. If the factorial reached 125, a third layer would count another five from each multiple of 125. Each layer represents an additional prime factor, not a duplicate observation accidentally counted twice.

Original Slope illustration for this worked example.
Original Slope illustration for this worked example.
Open full-size diagram ↗
05

Use divisibility of a difference carefully

If d divides both A and B, then it divides A−B: write A=du and B=dv, so A−B=d(u−v). This gives a sufficient condition. It is not necessary in general; neither five nor one is divisible by four, yet their difference is four. When using this idea with factorials, explain which individual divisibility facts you have established. Do not reject an arbitrary difference merely because a divisor fails to divide each term separately unless another part of the argument makes that rejection valid.

06

Prove a factorial difference has a common factor

Let p and q be positive integers with p greater than q. Then p factorial contains q factorial as a factor. Write p factorial as q factorial times the product from q+1 through p. Subtracting q factorial leaves q factorial times one less than that product. Thus q factorial always divides the difference. For p=7 and q=5, the difference is 5040−120=4920, and dividing by 120 gives forty-one. The symbolic factorization proves the general statement; the numerical example verifies one instance.

07

Disprove a stronger claim with an allowed case

It would be too strong to claim that p factorial always divides the difference. With p=7 and q=5, the positive difference 4920 is smaller than 5040, so it cannot be a positive multiple of 5040. Another tempting claim is that p−q must always divide the difference. Set p=9 and q=4: p−q equals five, nine factorial is divisible by five, and four factorial leaves remainder four. Their difference therefore leaves remainder one, providing a concrete counterexample to the universal claim.

08

Make the review method fit the claim

A must-hold statement needs a general argument or a logically complete classification. One successful numerical example cannot prove it. A single admissible counterexample can disprove it, however, so deliberately testing an extreme gap between two factorial indices can be efficient. For computational questions, verify cancellation and prime multiplicities rather than rerunning a huge multiplication. Finally check whether the requested quantity is a divisor, a remainder, a ratio or a count of zeros. They may use the same product representation, but they are different outputs.

PAUSE & TRYHow many trailing zeros are in 60!, and why?Reveal explanation

14: twelve multiples of five plus two extra fives from multiples of twenty-five.

Turn the idea into practice.

A fresh set will help you use the relationship with different numbers.

Practice this skill

Evidence & editorial note

New number-properties video, with distinct selected sections reused across three original companions. Selected captions read; notation independently checked. Full audiovisual review not performed.

Caption track SHA-256: e42df45b7520af48050d768e1e24290a6c7d9cc7be551c39efb7c2ffc57c5875
Source segment references are retained in the catalog. Full captions remain in the local research archive.

Factorials: count prime factors instead of expanding the number — GMAT Ninja