The number 131 is the 32nd prime number. It is a Honaker prime because the sum of its digits (1+3+1) equals the sum of the digits of the index in the list of primes (3+2).
Write a function to list Honaker primes less than or equal to the input number.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers17
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6871 Solvers
-
Back to basics 20 - singleton dimensions
279 Solvers
-
Duplicate each element of a vector.
639 Solvers
-
Find Index of maximum Value and maximum Value of a vector
173 Solvers
-
Detect a number and replace with two NaN's
200 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
