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 the 3n+1 sequence for n
Vectorize the digits of an Integer
Integer Sequence - II : New Fibonacci
Divisible by 2
Get all prime factors
Find the last non-zero digit in a primorial
List the Moran numbers
Determine whether a number is a prime self number
Generate a list of composite numbers
List the titles of Cody problems
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