Integers can be classified as generated numbers or self numbers. A generated number is one that can be expressed as the sum of another number and its digit sum. For example, 15 can be written as 12+(1+2); in other words, 15’s generator is 12. A self number cannot be expressed in this way.
Write a function to determine whether a number is a prime self number.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers17
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6680 Solvers
-
82 Solvers
-
Natural numbers in string form
1851 Solvers
-
289 Solvers
-
Form a square matrix from four square sub-matrices
130 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
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.