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
This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
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
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
n=3.
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.
n=3