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
-
Project Euler: Problem 7, Nth prime
1774 Solvers
-
Find and replaces spaces from a input string with *
172 Solvers
-
5178 Solvers
-
Write c^3 as sum of two squares a^2+b^2
331 Solvers
-
Spot the First Occurrence of 5
436 Solvers
More from this Author327
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
