Technique
Ordered factorisations by sending primes to places
Algebra • Permutations and Combinations
Statement
If with distinct primes, an ordered factorisation is fixed by choosing, for each prime, which factor it goes into. Each prime has choices, so there are ordered factorisations (factors equal to allowed).
How to use it
- 1Factorise into primes first.
- 2Each prime is placed independently, so multiply the choices.
Worked example
In how many ways can be written as , order mattering, with positive integers?
Step-by-step
- 1
Why: Three distinct primes.
- 2Each prime goes to , or :
Why: Three choices for each of three primes.
Answer
Watch out
It counts ordered triples. For triples with , remove the ones with equal entries and divide by .
Builds on
Also known as
distributing prime factors, number of factorisations