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.
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.
Count from 0 to N^M in base N.
199 Solvers
14161 Solvers
Arrange Vector in descending order
1430 Solvers
350 Solvers
Find best placement for ordered dominoes (harder)
187 Solvers