A problem where one must be at least a little careful about floating point arithmetic. It might have been interesting if one of the test cases were x=1e5 or larger. Even more interesting if the execution time were a factor in the "score". These factors might impact how the problem would be best solved.
@ 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 look into this?
Adding comment for testing badges!!
Is there a more compact way to calculate the sum of squares? (like how I calculated the square of sums)
My solution is failing,please help me out
1. You used the wrong formula for the sum of the squares of the the first x natural numbers. 2. Also, your implementation of the square of the sum of the first x natural number is incorrect. 3. Finally, You are to subtract (1) from (2) not the other way round.
How can I view the solution?
can someone explain what the value and size of a correct answer means.
I think simpler is impossible. The only thing is that it needs 8 operations...
For loops, not cool!
William, Why are for loops not cool?
Find common elements in matrix rows
Rotate a Matrix by 90 degrees
subtract central cross
Flag largest magnitude swings as they occur
String substitution, sub problem to cryptoMath
Poker Series 10: bestHand
Project Euler: Problem 3, Largest prime factor
Poker Series 11: selectBestHand
Find the treasures in MATLAB Central and discover how the community can help you!
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