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.
Word Counting and Indexing
Given an unsigned integer x, find the largest y by rearranging the bits in x
So many choices
N-Dimensional Array Slice
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
Award medals to winners
Construct dimensionless parameters
Solve the Challenger puzzle
Compute the Bernoulli numbers
Evaluate the Struve function
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