I am attempting problem 7 on project euler, I have come up with this solution which works fine for finding smaller nth prime numbers, but really lags when it comes to higher nth prime numbers, I am not quite sure where to start to make it more efficient, here it is: public class TenThousandFirst...
00:00 - 16:0016:00 - 00:00
00:00 - 16:0016:00 - 00:00