PreviousNext
Coding/Bits and math

Prime factorization

Write codeMedium18 min

Your task

Given an integer n (2 <= n <= 10^12), return its prime factorization as a list of [prime, exponent] pairs, sorted by ascending prime. For example, 60 = 2^2 * 3 * 5 should return [[2, 2], [3, 1], [5, 1]]. A prime input p returns [[p, 1]].

Examples

prime_factorization(n: int) -> list[list[int]]
Example 1
Inputprime_factorization(60)
Output[[2, 2], [3, 1], [5, 1]]