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 Solvers25
Suggested Problems
-
Return elements unique to either input
813 Solvers
-
Create a matrix with difference of each row of input matrix
76 Solvers
-
5983 Solvers
-
Convert to Binary Coded Decimal
154 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
426 Solvers
More from this Author325
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?