Recent content by sre2f

  1. S

    Prove that summation of n(n+1)/2 is true for all integers.

    We did not have to use induction. We were to do it by any method that would give the correct answer. As stated before, we have not been taught induction yet.
  2. S

    Prove that summation of n(n+1)/2 is true for all integers.

    I did that method and got 0 points out of 30 for the problem...
  3. S

    Prove that summation of n(n+1)/2 is true for all integers.

    I am not seeing where you get n(n+1) out of the addition...
  4. S

    Prove that summation of n(n+1)/2 is true for all integers.

    Is there another way to prove the summation formula other than induction. I have never been taught induction and just guessed that what I was doing was right. A friend of mine told me it looked like I proved it by induction...
  5. S

    Prove that summation of n(n+1)/2 is true for all integers.

    Prove that summation of n(n+1)/2 is true for all integers. Why is my proof not valid? Could someone explain to me how this is not a valid proof of the summation of "i" from i=1 to n: n(n+1)/2 Show for base cases: n=1: 1(1+1)/2=1 n=2: 2(2+1)/2=3 n=3: 3(3+1)/2=6 ... inductive...