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 Solvers15
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
2093 Solvers
-
Find third Side of a right triangle given hypotenuse and a side. No * - or other functions allowed
252 Solvers
-
The Answer to Life, the Universe, and Everything
578 Solvers
-
17703 Solvers
-
Divide elements by sum of elements
139 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!