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 Solvers16
Suggested Problems
-
4191 Solvers
-
Extract leading non-zero digit
2251 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
14110 Solvers
-
239 Solvers
-
Find my daddy long leg (No 's')
2813 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!