Technique
How many times a product like divides a number: count each prime, take the smaller
Quantitative Aptitude • Number System
Statement
Let with and different primes. Each copy of needs one and one . So if a number contains factors and factors , the largest for which divides it is the smaller of and . The same holds for a product of three or more different primes.
How to use it
- 1Split into its different primes.
- 2Break every factor of the number into primes and count each of 's primes.
- 3The prime with the smaller count limits the answer.
Worked example
What is the largest for which divides ?
Step-by-step
- 1.
- 2Twos: gives 3. Threes: and give .
- 3The smaller count is 3.
Why: Each 6 needs one 2 and one 3; the 2s run out first.
Answer
Watch out
Counting only one of the primes is the trap. The rule needs the primes in to be different: for , each copy needs two 2s.
Builds on
Also known as
highest power that divides, largest power of 35, limiting prime