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.
Construct an index vector from two input vectors in vectorized fashion
Cell Counting: How Many Draws?
Goldbach's marginal conjecture - Write integer as sum of three primes
List Honaker primes
Compute the largest number whose prime factors sum to n
Compute the nth Pythagorean prime
Test approximations of the prime counting function
Deduce the pattern behind the sequence
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