The description should be 9 + 16 = 5^2 and not 9+16 = 2^5 ?
Thanks Aurelien! Fixed it.
This is an interesting problem. Apparently everyone (including me) had to solve it by a basic brute force method with oly very slight variations. I did manage to use my MATLAB copy to use solve from the symbolic toolbox to get the answers, but the version of MATLAB on which Cody runs doesn't have access to a license for the symbolic toolbox.
@ Doug Hall, I have solved all the problems in the series. However, I have not received the badge and the associated scores on completion of the series. Can you please help me with this?
It works, but this code takes too long. Can I reduce the code's time?
lot1 = (floor(x/5));
lot2 = (floor(x/2.7):1:ceil(x/2.3));
lot = [lot1,lot2];
Doug: Just wondering if the last test case is incorrect. It seems like for the input of 3200, the p-triplet should be (700, 1152, 1348) and y_correct should be 1087027200. Please do let me know if I am wrong. Cheers, VL.
There is another one: (640,1200,1360). y_correct = 1044480000.
I just noticed that. I had thrown in a new test suite because someone had hardcoded the solutions in. I guess I did not test it right. Problem solved and submissions are being rescored now.
Stuff the Board
Find nth maximum
Side of a rhombus
Project Euler: Problem 2, Sum of even Fibonacci
Project Euler: Problem 7, Nth prime
Get ranking of a combination looking for speed.
Project Euler: Problem 3, Largest prime factor
Project Euler: Problem 6, Natural numbers, squares and sums.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office