Project Euler Forum

<deleted post>

vamsikal3 wrote: Fri Jan 13, 2017 8:23 pm I am attempting to verify a conjecture via brute-force to help me solve this problem, I have no alternate ways of verifying this yet. So, can someone confirm that F(2000) = [number removed]

Sorry, I think it's a little too early for further test values to appear here.

vamsikal3 wrote: Fri Jan 13, 2017 8:23 pm I am attempting to verify a conjecture via brute-force to help me solve this problem, I have no alternate ways of verifying this yet. So, can someone confirm that F(2000) = [number removed]

There is no number there (because it has been censored), so I can't really help you, but I would suggest to you that you attempt to solve the problem.

So far I am able to calculate F(5000) with code written in Python run on a regular PC in 15 minutes. Apparently this way calculating F(5000000) is not possible in reasonable time (or at all).
Although I simplified a lot, my code is still brute force as I calculate a result for every x.
My question now is: Is there
A) a totally different approach with which the problem can be solved on a regular PC, or
B) is it only possible on special computers with high calculating power and/or a different language?

The answer is A.