Category Archives: ProjectEuler

3

First time I thought about generating successive prime numbers to divide the aim number,  whose reminder is zero. If the reminder is not zero, then the previous prime number is the largest prime factor of the aim number. But it … Continue reading

Posted in ProjectEuler | Tagged , , | Leave a comment