feat(euler): Optimize problem 034 with a lower upper bound

[ArnabTechiee]

Contributes to #8594

Description

This pull request optimizes the solution for Project Euler Problem 34 (problem_034/sol1.py).

The change replaces the previous, larger upper bound calculation with a more efficient, mathematically proven limit of 1,499,999. This significantly reduces the number of iterations required to find the solution, making the code much faster.

This optimization is based on the proof referenced in the original issue.

How I Tested It

The updated solution's correctness has been verified by running the project's validation script:
python scripts/validate_solutions.py 34

[ArnabTechiee]

Hi @dhruvmanila,

I've submitted a pull request (#13531) that contributes to this optimization issue. It implements the suggested fix for Problem 034 by lowering the upper bound.

I would appreciate a review when you have a free moment. I'm ready to make any changes needed.

Thank you!

[mindaugl]

The link does not seem to work, it redirects to unrelated webpage.

[ArnabTechiee]

The link does not seem to work, it redirects to unrelated webpage.

Thanks again for the feedback, @mindaugl. I've replaced the previous link with a stable source from Rosetta Code that details the proof.