# Probability Problem

A man tosses a coin $$10$$ times, scoring $$1$$ point for each head and $$2$$ points for each tail. Let $$P(k)$$ be the probability of scoring at least $$k$$ points.

Find the largest value of $$k$$ such that $$P(k)>\frac{1}{2}$$

Note by Krishna Jha
4 years, 9 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

We can make use of a generating function to get the number of ways to score points:

$$G(z) = (z^1+z^2)^{10}$$

The coefficient of each $$z^i$$ for i=10..20 is the number of ways of scoring 'i' points.

We can see that the largest k occurs in the middle of the expansion, which is k=15

$$P(k=15) = \dfrac{\sum_{i=5}^{10}\binom{10}{i}}{2^{10}}=\frac{638}{1024}=0.623046875$$

- 4 years, 9 months ago

20

- 2 years, 10 months ago

pls check for the soln on the following link www.careerpoint.ac.in

- 4 years, 9 months ago