/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q. 1.5 In how many ways can a man divid... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 1: Q. 1.5 (page 19)

In how many ways can a man divide 7 gifts among his 3 children if the eldest is to receive 3 gifts and the others 2 each?

Short Answer

Expert verified

The no. of ways are 210.

Step by step solution

01

Step 1. Given information.

It is given that,

Total no. of gifts are =7

Total no. of children =3

Gifts to be given to eldest child=3

Gifts to be given to other two children=2each

02

Step 2. Find the no. of ways.

The no. of ways in which the eldest child will receive 3gifts and other two children will receive 2gifts each out of 7gifts is

73,2,2=7!3!2!2!=7脳6脳5脳4脳3!2脳2脳3!=7脳6脳5=210

Therefore, the no. of ways are210.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

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

Give an analytic proof of Equation (4.1).

1. (a) How many different 7-place license plates are possible if the first 2 places are for letters and the other 5 for numbers? (b) Repeat part (a) under the assumption that no letter or number can be repeated in a single license plate

In Problem 21, how many different paths are there from A to B that go through the point circled in the following lattice?

Prove that:

n+mr=n0mr+n1mr-1+..........+nrm0

Hint: Consider a group of nmen and mwomen. How many groups of size rare possible?

How many vectors x1,...,xkare there for which each role="math" localid="1647853392605" xiis a positive integer such that role="math" localid="1647853435585" 1鈮�xi鈮�nandrole="math" localid="1647853511159" x1<x2<路路路<xk?
See all solutions

Recommended explanations on Math Textbooks

Applied Mathematics

Read Explanation

Theoretical and Mathematical Physics

Read Explanation

Mechanics Maths

Read Explanation

Pure Maths

Read Explanation

Statistics

Read Explanation

Discrete Mathematics

Read Explanation
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.