Permatuation and combination problem, Mathematics

Assignment Help:

A student is allowed to select at most n-blocks from a collection of (2n + 1) books. If the total number of ways in which he can select a book is 63, find the value of n.

Solution) Σ2n+1Cr,(from r=1 to r=n)=(22n+1/2)-1=22n-1=63,n=3.


Related Discussions:- Permatuation and combination problem

HELP, WHAT TWO SIX DIDGIT NUMBERS CAN YOU ADD 984,357

WHAT TWO SIX DIDGIT NUMBERS CAN YOU ADD 984,357

The index of industrial production, The index of industrial production ...

The index of industrial production This is a quantity index compiled by the government. This measures changes in the volume of production in main industries. The index is a ex

Help, How do I solve step by step 7

How do I solve step by step 7

Fourier series - partial differential equations, Fourier series - Partial D...

Fourier series - Partial Differential Equations One more application of series arises in the study of Partial Differential Equations.  One of the more generally employed method

What are factors, What are Factors? When you multiply several numbers t...

What are Factors? When you multiply several numbers together, (4 x 5 x 3), the numbers (4, 5, and 3) being multiplied are called factors. The result of the multiplying th

Rational numbers, Although the set of integers caters to a larger aud...

Although the set of integers caters to a larger audience, it is inadequate. This inadequacy has led to the formulation of Rational numbers. Rational numbers are of

What is universal set, A non-empty set or group of which all the sets under...

A non-empty set or group of which all the sets under concern are subsets is known as the universal set. In any part of application of set theory, all the sets under concern might l

Find the number., There is a number. If the sum of digits is 14, and if 29 ...

There is a number. If the sum of digits is 14, and if 29 is subtracted from the number, the digits become equal. Find the number.

Find a longest common substring - suffix trees, 1. Using suffix trees, give...

1. Using suffix trees, give an algorithm to find a longest common substring shared among three input strings: s 1 of length n 1 , s 2 of length n 2 and s 3 of length n 3 .

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd