Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that if m and n are integers with m ≥ 3 and n ≥ 3, then R(m, n) ≤ R(m, n − 1) + R(m − 1, n)

Short Answer

Expert verified

\(R\left( {m,n} \right) \le R\left( {m - 1,n} \right) + R\left( {m,n - 1} \right)\)

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given

\(m\)and n are integers\(m \ge 3\)and\(n \ge 3\).

For a group of people\(\left\{ {1,2,3,........,r} \right\}\)

\(\begin{array}{l}p = R\left( {m - 1,n} \right)\\q = R\left( {m,n - 1} \right)\\r = p + q\end{array}\)

02

Explanation

Let L be the set of persons friends to\(1\)and M be the set of persons enemies to\(1\).

Therefore, L has at least P persons or M has at least q person.

If L has p people, then it contains a subset of \(m - 1\)persons who are mutual friends or it contains a subset of n persons who are mutual enemies .

If it contains a subset of \(m - 1\) persons who are mutual friends then \(m - 1\) person and person comprise of \(m\) person who are mutual friends.

03

Calculation

Therefore, a group of r people must include m mutual friends or n mutual enemies.

Therefore,

\(\begin{array}{l}R\left( {m,n} \right) \le r\\R\left( {m,n} \right) \le p + q\\R\left( {m,n} \right) \le R\left( {m - 1,n} \right) + R\left( {m,n - 1} \right)\end{array}\)

Similarly, if m has q persons then

\(R\left( {m,n} \right) \le R\left( {m - 1,n} \right) + R\left( {m,n - 1} \right)\)

04

Conclusion

\(R\left( {m,n} \right) \le R\left( {m - 1,n} \right) + R\left( {m,n - 1} \right)\)

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Prove the identity\(\left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right)\left( {\begin{array}{*{20}{l}}r\\k\end{array}} \right) = \left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right)\left( {\begin{array}{*{20}{l}}{n - k}\\{r - k}\end{array}} \right)\), whenever\(n\),\(r\), and\(k\)are nonnegative integers with\(r \le n\)and\(k{\rm{ }} \le {\rm{ }}r\),

a) using a combinatorial argument.

b) using an argument based on the formula for the number of \(r\)-combinations of a set with\(n\)elements.

How many ways are there to choose items from distinct items when

a) the items in the choices are ordered and repetition is not allowed?

b) the items in the choices are ordered and repetition is allowed?

c) the items in the choices are unordered and repetition is not allowed?

d) the items in the choices are unordered and repetition is allowed?

Find the value of each of these quantities:

a) C (5,1)

b) C (5,3)

c) C (8,4)

d) C (8,8)

e) C (8,0)

f) C (12,6)

How many ways are there to choose 6 items from 10 distinct items when

a) the items in the choices are ordered and repetition is not allowed?

b) the items in the choices are ordered and repetition is allowed?

c) the items in the choices are unordered and repetition is not allowed?

d) the items in the choices are unordered and repetition is allowed?

4. Every day a student randomly chooses a sandwich for lunch from a pile of wrapped sandwiches. If there are six kinds of sandwiches, how many different ways are there for the student to choose sandwiches for the seven days of a week if the order in which the sandwiches are chosen matters?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free