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 Solvers15
Suggested Problems
-
Which values occur exactly three times?
5245 Solvers
-
Program an exclusive OR operation with logical operators
751 Solvers
-
777 Solvers
-
Replace pattern 0 1 0 and 1 0 1
160 Solvers
-
Pernicious Anniversary Problem
840 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!