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
-
21604 Solvers
-
2532 Solvers
-
How to find the position of an element in a vector without using the find function
2820 Solvers
-
Calculate the Hamming distance between two strings
349 Solvers
-
Circular Primes (based on Project Euler, problem 35)
655 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!