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.
Return elements unique to either input
Vectorize the digits of an Integer
Replicate elements in vectors
Unique values without using UNIQUE function
Create the following sequence : 0 1 1 4 9 25 64 169 ...
Compute the nth Pythagorean prime
Eliminate redundant numbers in text
Count numbers whose reciprocals' decimal expansions terminate
Find pairs of primes with the same digit sum
Find the nth nude number
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