I loosened the tolerance on the test for s = 2. Increasing the number of primes seems to degrade the accuracy after a certain point, and the result becomes farther from the value listed in sequence A085548 in the Online Encyclopedia of Integer Sequences. This solution should pass now.
Encode Roman Numerals
Remove NaN ?
Test the generalized Legendre conjecture
Identify Wagstaff primes
Pass the cards in Fitch Cheney's five-card trick
Test approximations of the prime counting function
Compute the nth Naerogahtyp emirp
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