Given a positive integer n, return its prime factorization as a list — every prime that divides n, repeated as many times as it divides it, in ascending order. A composite number always has a factor at or below its own square root, so trial division never needs to test past √n — and once nothing else divides evenly, whatever is left over (if greater than 1) is itself prime.