Almost Primes
April 19, 2019
Today’s exercise was inspired by a task at Rosetta Code:
An integer n > 1 is a k-almost-prime if it is the product of k primes. Further, a k-almost prime is squarefree if all k primes are distinct.
You can learn more about k-almost-primes and their uses in number theory at Wikipedia or MathWorld.
Your task is to write programs that calculate the first ten k-almost-primes and squarefree k-almost-primes for 1 ≤ k ≤ 5. When you are finished, you are welcome to read or run a suggested solution, or to post your own solution or discuss the exercise in the comments below.
Programming Praxis 