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

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

Relationship between the graph and inverse function, Interesting relationsh...

Interesting relationship between the graph of a function and the graph of its inverse : There is one last topic that we have to address quickly before we leave this section.  Ther

Math, A small square is located inside a bigger square. The length of the s...

A small square is located inside a bigger square. The length of the small square is 3 in. The length of the large square is 7m. What is the area of the big square if you take out t

Operation research, difference between scope and application of operation r...

difference between scope and application of operation research

Properties of radicals, If n is positive integer greater than 1 and a & b b...

If n is positive integer greater than 1 and a & b both are positive real numbers then, Consider that on occasion we can let a or b to be negative and yet have these propert

Matrix, parts of matrix and functions

parts of matrix and functions

INVESTING MONEY, HOW MANY SHARES CAN I BUY WITH 1000 DOLLARS

HOW MANY SHARES CAN I BUY WITH 1000 DOLLARS

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