The quotient of a Moran number and its digit sum is prime. For example, 117 and 481 are Moran numbers because 117/(1+1+7) is 13 and 481/(4+8+1) = 37, and both 13 and 37 are prime.
Write a function to list the Moran numbers less than or equal to the input number.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers22
Suggested Problems
-
Flip the main diagonal of a matrix
901 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
103 Solvers
-
348 Solvers
-
Sum the 'edge' values of a matrix
398 Solvers
-
Sums of cubes and squares of sums
369 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!
@Tim, thanks for the idea of using ismember(). It greatly simplified my already simplest solution to date. All I did before was squeeze a literal implementation and make it work just fast enough to fit the one-minute filter..Your inspiration took me from four statements to two.
I believe I have the right solution but it is not fast enough, can anyone advise me on how to get the digit sum without using a for loop?