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.
Get the area codes from a list of phone numbers
387 Solvers
Given an unsigned integer x, find the largest y by rearranging the bits in x
476 Solvers
1079 Solvers
Project Euler: Problem 9, Pythagorean numbers
133 Solvers
Back to basics 8 - Matrix Diagonals
671 Solvers