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
-
Getting the indices from a matrix
733 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
795 Solvers
-
Solving Quadratic Equations (Version 1)
506 Solvers
-
Sum the real and imaginary parts of a complex number
145 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!