Browse · MathNet
PrintHong Kong Preliminary Selection Contest
Hong Kong number theory
Problem
How many triples of integers satisfy and ?
Solution
The prime factorisation of is . The problem amounts to counting the number of ways of distributing these 6 primes into 3 groups such that each group contains at least one prime. For example, if the groups are , and , then the corresponding factors are 66, 1007 and 61. By ordering the factors, we get and , and hence is a possible triple. We have a few cases to consider:
The number of primes in the 3 groups are 4, 1, 1 respectively (we shall abbreviate this as case (4, 1, 1)) — there are choices for the two singletons.
Case (3, 2, 1) — there are 6 choices for the singleton and then choices for the doubleton, leading to ways in this case.
* Case (2, 2, 2) — there are 5 ways to choose a partner for the prime 2, and 3 ways to choose a partner for one of the remaining primes. Afterwards, the two primes left form the last group automatically. Hence there are ways to do so.
It follows that the answer is .
The number of primes in the 3 groups are 4, 1, 1 respectively (we shall abbreviate this as case (4, 1, 1)) — there are choices for the two singletons.
Case (3, 2, 1) — there are 6 choices for the singleton and then choices for the doubleton, leading to ways in this case.
* Case (2, 2, 2) — there are 5 ways to choose a partner for the prime 2, and 3 ways to choose a partner for one of the remaining primes. Afterwards, the two primes left form the last group automatically. Hence there are ways to do so.
It follows that the answer is .
Final answer
90
Techniques
Prime numbersFactorization techniques