Results 1 to 2 of 2

Thread: Mathematical Inductions of Combinations

  1. March 10th 2009, 07:29 AM #1
    Mel
    Mel is offline
    Junior Member
    Joined
    Sep 2008
    Posts
    36

    Mathematical Inductions of Combinations

    If n is an integer and n > or = 2, prove recursively that the sum of the combinations C(J,2) from J=2 to N, is equal to the combination C(N+1, 3).
    Follow Math Help Forum on Facebook and Google+
  2. March 10th 2009, 07:38 AM #2
    red_dog
    red_dog is offline
    MHF Contributor red_dog's Avatar
    Joined
    Jun 2007
    From
    Medgidia, Romania
    Posts
    1,241
    C_2^2+C_3^2+C_4^2+\ldots+C_n^2=

    =(\underbrace{C_3^3+C_3^2}_{C_4^3})+C_4^2+\ldots+C _n^2=

    =(\underbrace{C_4^3+C_4^2}_{C_5^3})+\ldots+C_n^2=

    \ldots\ldots\ldots\ldots\ldots

    =C_n^3+C_n^2=C_{n+1}^3
    Follow Math Help Forum on Facebook and Google+
« Network Problem | [SOLVED] Induction »

Similar Math Help Forum Discussions

  1. Inductions problem?
    Posted in the Algebra Forum
    Replies: 9
    Last Post: November 2nd 2010, 05:23 AM
  2. Inequality Inductions
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: August 20th 2009, 10:28 PM
  3. Mathematical induction
    Posted in the Calculus Forum
    Replies: 1
    Last Post: January 6th 2009, 09:03 PM
  4. Inductions
    Posted in the Algebra Forum
    Replies: 2
    Last Post: April 23rd 2008, 08:57 AM
  5. Mathematical inductions
    Posted in the Algebra Forum
    Replies: 2
    Last Post: March 24th 2008, 05:31 PM

Search Tags


/mathhelpforum @mathhelpforum