Problem 49778. Determine whether a number is a prime self number
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
J.R.! Menzinger
on 4 Aug 2021
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)
ChrisR
on 28 Aug 2021
Thanks for pointing that out. I've made the change.
Solution Comments
Show commentsProblem Recent Solvers14
Suggested Problems
-
98423 Solvers
-
Project Euler: Problem 3, Largest prime factor
1404 Solvers
-
Volume difference between Ellipsoid and Sphere
127 Solvers
-
Return fibonacci sequence do not use loop and condition
530 Solvers
-
81 Solvers
More from this Author271
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!