I notice that p=isprime(x) can be a lot slower than p=ismember(x,primes(max(x))); for x=1:1e7, the former takes about 100 seconds and the latter takes about 0.1 seconds.
Nice observation. I'll keep that one in mind.
Roll the Dice!
Project Euler: Problem 8, Find largest product in a large string of numbers
Back to basics 8 - Matrix Diagonals
"Low : High - Low : High - Turn around " -- Create a subindices vector
Solving Quadratic Equations (Version 1)
Find the nth Fibbinary number
Compute a sum involving the totient over divisors of a number
Identify Wagstaff primes
Find the nth nude number
Find the zeros of the Bessel function of the first kind
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