/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q.7.1 7.1. Consider a list of m names,... [FREE SOLUTION] | 91影视

91影视

7.1. Consider a list of m names, where the same name may appear more than once on the list. Let n(i),i=1,...,m, denote the number of times that the name in position iappears on the list, and let d denote the number of distinct names on the list.

(a) Express d in terms of the variables m,n(i),i=1,...,m. Let U be a uniform (0, 1) random variable, and let X=[mU]+1.

(b) What is the probability mass function of X?

(c) Argue that E[m/n(X)]=d.

Short Answer

Expert verified
  1. The required expression of dwill be d=i=1m1n(i).
  2. The probability mass function of X will be P(X=i)=1m
  3. The value can be said that asEmn(X)=d.

Step by step solution

01

Given information (Part a)

n(i),i=1,,m is the number of times that the name in position iappears on the list

d=the number of distinct names on the list

02

Solution (Part a)

Express din terms of m.

Here, dis the number of distinct names on the list and n(i)is the number of times that the name in ithposition appears on the list.

The total number of name in the list is determined as,

Total number of names=m

=i=1m(n(i))d

From the overhead expression of the total number of names, dcan be expressed in terms of n(i)and m. Hence, dis expressed as:

m=i=1m(n(i))d

i=1m1=di=1m(n(i))

d=i=1m1i=1m(n(i))

d=i=1m1n(i)

03

Final answer (Part a)

Thus, the required expression of d will be d=i=1m1n(i).

04

Given information (Part b)

n(i),i=1,,mis the number of times that the name in position iappears on the list

d=the number of distinct names on the list

05

Solution (Part b)

We need to calculate the probability mass function of X.

If a random variable, U that follows uniform distribution between 0 and 1 .

So that, the probability density function of U is,

fU(u)=1鈥呪赌呪赌呪赌0u10鈥呪赌呪赌呪赌Otherwise

If a random variable X and it is defined as X=[mU]+1.

The probability mass function of Xis determined as:

P(X=i)=P([mU]+1=i)

=P([mU]=i1)

=P(i1mU<i)

=Pi1mU<im

06

Step 6:Solution (Part b)

Using the probability density function of U, the probability mass function of X is simplified as:

P(X=i)=Pi1mU<im

=i1mim1du

=[u]i1mim

=imi1m

=1m

07

Final answer (Part b)

Thus, the probability mass function of X will be P(X=i)=1m.

08

Given information (Part c)

n(i),i=1,,mis the number of times that the name in position iappears on the list

d=the number of distinct names on the list

09

Solution (Part c)

If Emn(X)=d

The expected value of a random variable Y will be E(Y)=yyP(Y=y)

Now,P(Y=y) is the probability mass function of the random variable Y.

Now we need to calculate the value of Emn(X)

Emn(X)=i=1mmn(i)P(X=x)

=i=1mmn(i)1m

=i=1m1n(i)

=d

10

Final answer (Part c)

Thus, the value can be said thatEmn(X)=d

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

N people arrive separately to a professional dinner. Upon arrival, each person looks to see if he or she has any friends among those present. That person then sits either at the table of a friend or at an unoccupied table if none of those present is a friend. Assuming that each of the N2pairs of people is, independently, a pair of friends with probability p, find the expected number of occupied tables.

Hint: Let Xiequal 1or 0, depending on whether theith arrival sits at a previously unoccupied table.

Suppose that each of the elements of S={1,2,,n}is to be colored either red or blue. Show that if A1,,Arare subsets of S, there is a way of doing the coloring so that at most i=1r(1/2)Ai-1of these subsets have all their elements the same color (where |A|denotes the number of elements in the set A).

For Example 2i, show that the variance of the number of coupons needed to a mass a full set is equal toi=1N1iN(Ni)2

When Nis large, this can be shown to be approximately equal (in the sense that their ratio approaches 1 as N) to N22/6.

Ten hunters are waiting for ducks to fly by. When a flock of ducks flies overhead, the hunters fire at the same time, but each chooses his target at random, independently of the others. If each hunter independently hits his target with probability .6, compute the expected number of ducks that are hit. Assume that the number of ducks in a flock is a Poisson random variable with mean 6.

A bottle initially contains m large pills and n small pills. Each day, a patient randomly chooses one of the pills. If a small pill is chosen, then that pill is eaten. If a large pill is chosen, then the pill is broken in two; one part is returned to the bottle (and is now considered a small pill) and the other part is then eaten.

(a) Let X denote the number of small pills in the bottle after the last large pill has been chosen and its smaller half returned. Find E[X].

Hint: De铿乶e n + m indicator variables, one for each of the small pills initially present and one for each of the small pills created when a large one is split in two. Now use the argument of Example 2m.

(b) Let Y denote the day on which the last large pills chosen. Find E[Y].

Hint: What is the relationship between X and Y?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.