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
-
17129 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1299 Solvers
-
Remove the two elements next to NaN value
713 Solvers
-
Implement a bubble sort technique and output the number of swaps required
402 Solvers
-
426 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!