Display first N natural numbers, the divisors of which are only 2, 3 and 7. I wrote something like that. I am a beginner in Lisp. Thank you! ...
Display first N natural numbers, the divisors of which are only 2, 3 and 7. I wrote something like that. I am a beginner in Lisp. Thank you! ...
I'm trying to learn Haskell and comprehension lists but cannot find solution on this: After my trials the result is something like this because ...
Here's a somewhat different approach to generating the sequence of Hamming numbers (aka regular numbers, 5-smooth numbers) based on the interval from ...
Consider the finite set {2,3,5,...,n}. I am interested in primes but the question could apply to any set of numbers. I want to find all possible produ ...
So the problem is: Write a program to find the nth super ugly number. Super ugly numbers are positive numbers whose all prime factors are in the giv ...
I've been trying to implement Dixon's factorization method in python, and I'm a bit confused. I know that you need to give some bound B and some numbe ...
I am trying to generate hamming numbers in haskell, the problem is I get duplicate #'s in my output list and I cannot figure out why exactly. Should I ...
I have a set of prime numbers and I have to generate integers using only those prime factors in increasing order. For example, if the set is p = {2, ...
Regular numbers are numbers that evenly divide powers of 60. As an example, 602 = 3600 = 48 × 75, so both 48 and 75 are divisors of a power of 60. ...
How do you print numbers of form 2^i * 5^j in increasing order. ...
A friend of mine is interviewing for a job. One of the interview questions got me thinking, just wanted some feedback. There are 2 non-negative integ ...