Search:

Type: Posts; User: helloworld922

Search: Search took 0.12 seconds.

  1. Re: Trying 3 different ways to do the same thing, each one is wrong

    Actually, the answer to this problem is 232792560, which easily fits into an int (max size=2147483647).

    See this post to see why ;)
  2. Re: Trying 3 different ways to do the same thing, each one is wrong

    One last small modification. I'll let you see if you can figure out how to fix it, but here's a hint:

    What happens when count is divisible by 2, but not 3? The logic would become true and true and...
  3. Re: Trying 3 different ways to do the same thing, each one is wrong

    Are you familiar with set theory, Norm?

    Basically, what I'm saying is that any set of prime factors is a subset of that main set A = {2, 2, 2, 2, 3, 3, 5, 7, 11, 13, 17, 19}

    So, if you take the...
  4. Re: Trying 3 different ways to do the same thing, each one is wrong

    The smallest number divisible by a set of numbers is the smallest set of common prime factors.

    So, you just need a list of prime factors for each number and then compute the smallest set that...
Results 1 to 4 of 4