Hi everyone,

Please check out episode 3 of the Q For Problems video series.

This covers problem 3 from the Project Euler problem set. Project Euler - Problem 3

This problem wants us to find the largest prime factor of a large number.

It has been split into two parts due to the length of the video.

Part 1 covers the Trial Division algorithm and part 2 covers Pollard's Rho algorithm for prime factorisation

Feel free to share your own solutions and ideas in the comments.

Links:

qForProblems Git Repo

Blog post: Finding primes with q

Thanks