Talk:Largest prime factor

One problem I see is a disconnect between the generality of the task title -- to find the largest prime factor of a number -- and the specificity of the statement of the task, which is to solve Project Euler Problem 3 by finding the largest prime factor of a very particular number (600,851,475,143). A few of the solutions offer code that is efficient but also dependent upon the number in question being odd and having no repeated prime factors. It would be better, I think, if the statement of the task were to write a function, procedure, or method that would return the largest prime factor of any positive integer greater than 1, and then to show that it works by applying it to the Project Euler number. (The ALGOL 68 solution is a good example of that approach.) Of course, Project Euler Problem 3 doesn't really need a purpose-written solution at all: prime decomposition is already a task on Rosetta Code, and simply applying one of those solutions to the mysterious Problem 3 number will return its four prime factors (71, 83, 1471, and 6857), with the last necessarily being the largest.