A student is allowed to select at most ‘n’ books from a collection of 2n + 1 books. If the total
number of ways in which a student selects atleast one book is 63 then the value of n is

Do you know? If yes.Then why are you asking for it? If no here you go:
for selecting k books from 2n+1 books number of ways is: 2n+1 C k.
Like that we can say required answer is
(2n+1 C 0)+(2n+1 C 1)+.........(2n+1 C n)-1=(2^(2n+1)/2)-1=63 =>n=3.

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestn=3.

Log in to reply

n=3

Log in to reply

give the solutions please??

Log in to reply

Do you know? If yes.Then why are you asking for it? If no here you go: for selecting k books from 2n+1 books number of ways is: 2n+1 C k. Like that we can say required answer is (2n+1 C 0)+(2n+1 C 1)+.........(2n+1 C n)-1=(2^(2n+1)/2)-1=63 =>n=3.

And please try to post better problems.

Log in to reply