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.
Which values occur exactly three times?
Project Euler: Problem 9, Pythagorean numbers
Get the length of a given vector
Generate a vector like 1,2,2,3,3,3,4,4,4,4
Compute a sum involving the totient over divisors of a number
Construct a continued fraction for a square root
Count the primes in Collatz sequences
Identify Ruth-Aaron numbers
List ways to reach a target sum
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