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
-
Find the numeric mean of the prime numbers in a matrix.
9157 Solvers
-
Remove all the words that end with "ain"
2700 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1287 Solvers
-
Generate a random matrix A of (1,-1)
430 Solvers
-
537 Solvers
More from this Author324
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!