The kth Factor of n — LeetCode 1492 Python Solution

The problem

You are given two positive integers n and k. A factor of an integer n is defined as an integer i where n % i == 0.

Example

Input

n = 12, k = 3

Output

3

Explanation

Factors list is [1, 2, 3, 4, 6, 12], the 3rd factor is 3.

Python solution

class Solution:
    def kthFactor(self, n: int, k: int) -> int:
        for i in range(1, n + 1):
            if n % i == 0:
                k -= 1
                if k == 0:
                    return i
        return -1

Complexity

Pattern: Math and Number Theory

Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1492. The kth Factor of n is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math and Number Theory.

The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.

Related problems