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
-
1812 Solvers
-
Set the array elements whose value is 13 to 0
1435 Solvers
-
Detect a number and replace with two NaN's
199 Solvers
-
734 Solvers
-
479 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
