Description
Given an integer n ≥ 2, return the largest prime factor of n.
Examples
Input:
n = 13195Output:
29Explanation:
The factorization 13195 = 5 * 7 * 13 * 29 has largest prime factor 29.
Input:
n = 2Output:
2Explanation:
Since 2 is itself prime, its largest prime factor is 2.
Input:
n = 600851475143Output:
6857Explanation:
The Project Euler problem 3 value 600851475143 has largest prime factor 6857.
Constraints
- •
2 ≤ n ≤ 10¹²