HumanEval/59

[TwoFX]

This issue tracks the progress of our solution of HumanEval59.

[TwoFX]

Use the following algorithm: iterate d from 2 to n. When encountering a divisor, set n := n / d as long as d divides n and continue. This way we find all of the prime factors, and the last one must be the largest prime factor.

[datokrat]

Solved in #268