Scroll down to see how it works. If you'd rather solve the problem yourself, don't scroll. . . . . . How it works (this is a spoiler): ========================================= This project uses a recursive method to find the answer. We create a "factor ()" block which will find the smallest factor of the inputted number. It does so by setting a variable, i, to 2 and continually increasing it until i is a factor of the inputted number. If i is equal to the inputted number, that means that the inputted number is prime. Thus, we have found our answer. (Then we set the "result" variable to i and are finished.) If it is not, then we have found the smallest factor of the inputted number. We then divide the factor out of the number, giving us a new, smaller, number. We put that number back into the "factor ()" block and start the process again. This answer is a bit more confusing than the others due to its recursive nature, but in the end, we get a variable called "result" with our answer.
The @ProjectEuler account is created and maintained by @PullJosh. If you have questions, feel free to comment here or on my @PullJosh profile page for a much quicker response.
