Project Euler Forum

my method is have three place values x, y, z. x^2 + y^3 + z^4.
I increment z by primes until max then increment y and start over with the z's. Etc....
Similar to counting 001, 002, ... , 009, 010, 011, ...
I can not figure out why this is producing errors. I keep getting 1139575??

I pm'ed you.

hi,
can you send me the same mp?

I'm getting the same number (1139575), although I have different method. Any help?

Are you sure there are 1139575 different numbers below fifty million with the property stated in Problem 87 (View Problem)?

Hmm, are you suggesting different primes could lead to the same sums? Maybe that's the problem

Phibonacci wrote: Sun Jan 18, 2009 1:57 am my method is have three place values x, y, z. x^2 + y^3 + z^4.
I increment z by primes until max then increment y and start over with the z's. Etc....
Similar to counting 001, 002, ... , 009, 010, 011, ...
I can not figure out why this is producing errors. I keep getting 1139575??

I get the same result. How do I verify that this result is correct?

One simple example: 5^4 + 2^3 + 2^2 = 3^4 + 3^3 + 23^2

Thank you very much !

No problem with the correct answer, but execution time was an issue - 7071 squares x 368 cubes x 84 fourth power - 218 million iterations took a long long time in python. Moreover I couldn't work out why the execution time increased as it progressed; must be the overhead of the growing list object. Increased for each of the fourth powers from 13 seconds 1st, up to 360, then dropped in the last 4 iterations

laogui wrote: Sat Jul 15, 2023 1:10 pm No problem with the correct answer, but execution time was an issue [...]

Welcome to Project Euler!
Note that this forum is only for clarifications of the problem statements. Discussion of methods and their runtimes should take place in the problem solution threads on the main site, e.g. https://projecteuler.net/thread=87 for this problem. Could you please move your post there. Thanks!