I think the answer to problem 7 should be [0 1 1 1 1 1 1 1 1 0 1 0], because q=31 leads to a Wagstaff prime.
Yes, you're right. Thanks, William. I've corrected the test suite. I should have known there was a problem because Athi's solution stepped around 31.
Sums with Excluded Digits
Replace NaNs with the number that appears to its left in the row.
Check if number exists in vector
Split a string into chunks of specified length
Center of mass
List the dihedral primes
List Honaker primes
Compute the fractional derivative
Characterize the final state of the digit inventory sequence
Find the smallest integer m such that n divides m!
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