Problem 49778. Determine whether a number is a prime self number
Solution Stats
Problem Comments
-
2 Comments
Nice Problem!
but I found remarkable your syntax on test case Nr. 27:
a = arrayfun(@(k) isPrimeSelf(n(k)),1:length(n));
if you use 'arrayfun' you can actually parse the vector directly and you can avoid parsing the indices. The following expression would be more narrow:
a = arrayfun(@isPrimeSelf,n)
Thanks for pointing that out. I've made the change.
Problem Recent Solvers11
Suggested Problems
-
Remove any row in which a NaN appears
7582 Solvers
-
Find a subset that divides the vector into equal halves
360 Solvers
-
Split a string into chunks of specified length
932 Solvers
-
Chebyshev polynomials of the 2nd Kind
59 Solvers
-
The sum of individual numbers...
68 Solvers
More from this Author148
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!