Problem 2674. Generalised Hamming Number
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.
Solution Stats
Problem Comments
-
4 Comments
Show
1 older comment
Jean-Marie Sainthillier
on 20 Nov 2014
Thank you Jonathan. I have discovered this philosophy thanks to James and @bmtran problems.
Asif Newaz
on 25 Dec 2019
is there any mathematical algorithm that i dont know about to calculate such big range(10^13)?
i minimized my code as best as i can.still fails for such large number.
Nguyen Minh Dat
on 13 Aug 2021
why i can't submit my solutions
Solution Comments
Show commentsGroup

Project Euler IV
- 11 Problems
- 16 Finishers
- Bouncy numbers
- Generalised Hamming Number
- Project Euler 249: Prime Subset Sums
- Pseudo Square Root (Inspired by Project Euler 266)
- Golomb's self-describing sequence (based on Euler 341)
- Pandigital Factors (Based on Euler 491)
- Pandigital Multiples of 11 (based on Project Euler 491)
- It's going down. We're finding simbers!
- Odd elimination
- Decimation
- Day counter function
Problem Recent Solvers331
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!