Problem 2674. Generalised Hamming Number

• Created by Jean-Marie Sainthillier
• Appears in 3 groups

×

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

Magic Numbers

• 19 Problems
• 84 Finishers

Basics - Factorization

• 10 Problems
• 227 Finishers

Project Euler IV

• 11 Problems
• 16 Finishers

Like (13)

Difficulty:

(159)

Rate

• Solve Later   
• Add To GroupÂ

Inspired by Project Euler n°204 and Problem 1308 by James

A generalised Hamming number of type n, has no prime factor larger than n.

For example a generalised Hamming number of type 5 has no prime factor larger than 5.

Given a number X, determine how many generalised Hamming numbers n are less than or equal to that number. Please note that 1 counts as a Hamming number.

Solve

Solution Stats

36.02% Correct | 63.98% Incorrect

• 1116 Solutions
• 332 Solvers

Last Solution submitted on May 01, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers332

Suggested Problems

• Sort a list of complex numbers based on far they are from the origin.

  5710 Solvers

• Choose the best fitting dominoes

  218 Solvers

• Rotate input square matrix 90 degrees CCW without rot90

  641 Solvers

• Circular Primes (based on Project Euler, problem 35)

  572 Solvers

• Convert given decimal number to binary number.

  2149 Solvers

More from this Author43

• Can you beat the lottery again (for hardcore coder) ?

  14 Solvers

• How many monitors are connected ?

  153 Solvers

• Sum of big primes without primes

  143 Solvers

• Pandigital number n°1 (Inspired by Project Euler 32)

  106 Solvers

• Return a list sorted by number of consecutive occurrences

  391 Solvers