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
-
12713 Solvers
-
1069 Solvers
-
Chebyshev polynomials of the 1st Kind
81 Solvers
-
Number of odd and even elements within matrix
161 Solvers
-
Check if a matrix is a palindrome in all directions
136 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!