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
-
Extract leading non-zero digit
2252 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2900 Solvers
-
Back to basics 25 - Valid variable names
339 Solvers
-
Solving Quadratic Equations (Version 1)
506 Solvers
-
Sums of cubes and squares of sums
377 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!