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
-
Find common elements in matrix rows
2713 Solvers
-
Back to basics 6 - Column Vector
1106 Solvers
-
539 Solvers
-
Matrix indexing with two vectors of indices
775 Solvers
-
Circular Primes (based on Project Euler, problem 35)
651 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!