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
-
Return the 3n+1 sequence for n
8539 Solvers
-
Project Euler: Problem 10, Sum of Primes
2131 Solvers
-
579 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
984 Solvers
-
1040 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!