Problem 52288. List Honaker primes

• Created by ChrisR
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Magic Numbers IV

• 20 Problems
• 24 Finishers

Project Euler IV

• 11 Problems
• 16 Finishers

Like (2)

Difficulty:

(17)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

57.14% Correct | 42.86% Incorrect

• 42 Solutions
• 13 Solvers

Last Solution submitted on Sep 12, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers13

Suggested Problems

• Cell joiner

  6623 Solvers

• Project Euler: Problem 9, Pythagorean numbers

  1301 Solvers

• Find the largest value in the 3D matrix

  1555 Solvers

• Vectorize the digits of an Integer

  326 Solvers

• Better Index Number

  84 Solvers

More from this Author298

• Construct the number counts sequence

  4 Solvers

• Compute the area of a lune

  7 Solvers

• Determine aquifer properties: slug test

  2 Solvers

• Determine whether a number is a prime self number

  15 Solvers

• Identify prime words

  16 Solvers