If I'm reading the problem statement right, I think either the answer to test case 2 should be 867 (123^3 = 1860867.) or n=2 (123^2=15129).
James, you are correct. Problem statement and test suite have been fixed.
Find the longest sequence of 1's in a binary sequence.
Find all elements less than 0 or greater than 10 and replace them with NaN
Implement a ROT13 cipher
Find perfect placement of non-rotating dominoes (easier)
Fermat's Last Theorem - Fermat's conjecture
Big numbers, repeated least significant digits
Given the name from the legend, return the handle
Generate a NaN...on purpose
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