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.
First non-zero element in each column
Is X a Fibonacci Matrix?
Piecewise linear interpolation
Number of Even Elements in Fibonacci Sequence
Count the square-full divisors of a number
Compute the largest number whose prime factors sum to n
Compute the Euler totient function
Solve an ODE: equation A
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