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
-
Return the largest number that is adjacent to a zero
5531 Solvers
-
902 Solvers
-
Create matrix of replicated elements
401 Solvers
-
Fix the last element of a cell array
1854 Solvers
-
Van Eck's Sequence's nth member
333 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!
