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 Solvers16
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
256 Solvers
-
505 Solvers
-
1282 Solvers
-
Calculate the derivative of a polynomial
240 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
955 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!