Purchase Solution

Recursive relationships

Not what you're looking for?

Ask Custom Question

Consider the recursive relationship for combinations:

C(n,r) = C(n-1,r) + C(n-1,r-1)

Prove this relationship algebraically using the mathematical definition of a combination, as well as that of the factorial function.

Provide a logical explanation for this relationship (Hint: consider n objects as consisting of n-1 existing objects plus a new nth object. Given the ultimate goal of selecting r objects from the entire set of n, you must select objects from the set of n-1 objects and decide how the new nth object should join the existing selected sets.)

Purchase this Solution
Solution Summary

This solution shows a simple proof regarding recursive relationships. It is solved in step by step format.

Solution Preview

Because, C(n,r) = n!/(r!*(n-r)!)
RHS:
C(n-1,r) + C(n-1,r-1)
= {(n-1)!/(r!*(n-1-r)!)} + {(n-1)!/((r-1)!*(n-r)!}
= {(n-1)!/((r-1)!*(n-r-1)!)} * { (1/r) + (1/(n-r))}
(Because, (n-r)! = (n-r-1)!*(n-r); r! = (r-1)!*r)

= {(n-1)!/((r-1)!*(n-r-1)!)} * {(n-r + ...

Solution provided by:
Amrit Lal Ahuja, PhD (IP)
Education
  • BEng, Allahabad University, India
  • MSc , Pune University, India
  • PhD (IP), Pune University, India
Recent Feedback
  • " In question 2, you incorrectly add in the $3.00 dividend that was just paid to determine the value of the stock price using the dividend discount model. In question 4 response, it should have also been recognized that dividend discount models are not useful if any of the parameters used in the model are inaccurate. "
  • "feedback: fail to recognize the operating cash flow will not begin until the end of year 3."
  • "Answer was correct"
  • "Great thanks"
  • "Perfect solution..thank you"
Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Database Design

    How are recursive relationships handled? A recursive relationship is a relationship among entities of the same class, and is represented in the same way as other relationships are. The rows of the tables can take two different roles, however.

  • Advantages of Object-Oriented Development

    Dynamic views include descriptions of objects, attributes, behaviors, and relationships. 7. A system design is a high-level abstraction of what will become the program design. 8. Systems design is a recursive process. 9.

  • Recursive definition

    <=a_(n-1) (*) (3)Since {L_(n-1), a_n} satisfying a_(n-1)<=a_n is sorted by the recursive definition, then together with(*), we have a_1<=a_2<=...<= a_(n-1)<=a_n, which is sorted by non-recursive definition (b) Non-recursive Recursive Prove by

  • Iterative and Recursive Algorithms

    Hi, An example of a recursive algorithm is computation of a power of 2. Using recursive algorithm, we have: power_2 (int n) //power_2 is a recursive function using the n, value of exponent, as argument.

  • Recursive Algorithm

    For the recursive example above, we would let x = 1. 3) Use a for-next loop for the recursive process.

  • How to Convert a Recursive Procedure into Iterative

    Recursive Procedure: A recursive procedure is a method or a function that calls itself over and over again as long as it satisfies the recursive conditionm[1][2].

  • Recursive Algorithm for Given Integer Array A

    175072 Recursive Algorithm for Given Integer Array A Implement two recursive algorithms to solve the following problems: Problem 1: Implement a recursive algorithm to find the maximum element of given integer array A.

  • Recursion C++

    What is a recursive case? The base case of a recursive function is the the condition when the recursion will terminate The recursive case is the condition when the function will repeatedly call itself.

  • Write a Recursive Function to Print a String Backwards

    106311 Write a program that uses a recursive function to print a string backwards. Write a program that uses a recursive function to print a string backwards. Your program must contain a recursive function that prints the string backwards.

View More Related Solutions