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??
Problem 087
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
-
Phibonacci
- Posts: 10
- Joined: Fri Nov 28, 2008 4:04 am
- Location: Des Moines, IA
- Contact:
-
Tommy137
- Posts: 238
- Joined: Sun Feb 24, 2008 6:02 pm
- Location: Cologne, Germany
- Contact:
-
giorgiolx
- Posts: 1
- Joined: Wed Apr 01, 2009 4:11 pm
-
MaJJ
- Posts: 49
- Joined: Tue Oct 14, 2008 12:14 am
-
stijn263
- Posts: 1505
- Joined: Sat Sep 15, 2007 11:57 pm
- Location: Netherlands
Re: Problem 087
Are you sure there are 1139575 different numbers below fifty million with the property stated in Problem 87 (View Problem)?
-
MaJJ
- Posts: 49
- Joined: Tue Oct 14, 2008 12:14 am
Re: Problem 087
Hmm, are you suggesting different primes could lead to the same sums? Maybe that's the problem 
-
Alex-82w4
- Posts: 20
- Joined: Fri Jan 13, 2017 4:37 pm
Re: Problem 087
I get the same result. How do I verify that this result is correct?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??
The friend key is 1004797_CkgowZqfFi0qQMGOqVjB0RP8htEhkWW2
-
v6ph1
- Posts: 134
- Joined: Mon Aug 25, 2014 7:14 pm
-
Alex-82w4
- Posts: 20
- Joined: Fri Jan 13, 2017 4:37 pm
-
laogui
- Posts: 7
- Joined: Tue Jun 06, 2023 3:05 pm
Re: Problem 087
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
-
RobertStanforth
- Administrator
- Posts: 2666
- Joined: Mon Dec 30, 2013 11:25 pm
Re: Problem 087
Welcome to Project Euler!laogui wrote: Sat Jul 15, 2023 1:10 pm No problem with the correct answer, but execution time was an issue [...]
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!