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
I like your test suite. Using large X forces a better solution.
Thank you Jonathan. I have discovered this philosophy thanks to James and @bmtran problems.
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.
why i can't submit my solutions
Solution Comments
Show commentsProblem Recent Solvers293
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15528 Solvers
-
Find relatively common elements in matrix rows
2051 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1041 Solvers
-
511 Solvers
-
Side of an equilateral triangle
6141 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!