Search:

Type: Posts; User: Zaphod_b

Search: Search took 0.12 seconds.

  1. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    That's great!

    So, you figured out that the loop control for this problem should have been completely equivalent to your integer version, right?


    BigInteger num = BigInteger.ONE;
    ...
  2. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    And you didn't notice that it was different from the answer(s) that I posted? I always try to come up with an independent way to check my work, and I even showed the answer obtained from an...
  3. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    Well...

    I just registered at projecteuler.net and submitted the answer to problem #15 that I have posted here several times: 137846528820
    It was accepted.

    I am apparently the 55434th person...
  4. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    I meant that I won't go into the combinatorial "solution" any more. (Well not after these few words.)
    What I like about the combinatorial solution is that I can arrive at a closed formula without...
  5. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    I have no connection with or knowledge of Project Euler, and I don't have any ideas about anything else outside the discussion in my post.

    Here's the thing:


    I believe my description of how...
  6. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    IF you have never heard of "the number of combinations of N things taken K at a time, you might start here: Combinations-Wikipedia

    The number of combinations of N things taken K at a time is given...
  7. Replies
    22
    Views
    2,468

    Re: Help with 2-d arrays, tough problem

    Well, since you put it that way, here are my thoughts:


    I will restate the problem in a way that is specific enough for me to boil it down to something that is not very complicated (to me).

    ...
Results 1 to 7 of 7