To solve these problems, we'll utilize the concepts of the geometric distribution, which

models the number of trials needed to achieve the first success in a sequence of

independent Bernoulli trials. In this case, success corresponds to producing a defective

transistor.

Given:

● Defective rate = 2% = 0.02

● Batch size = 100

● Another machine's defective rate = 5% = 0.05

Let's address each part of the problem:

Probability that the 10th transistor produced is the first with a defect: We're essentially

asking for the probability of getting 9 non-defective transistors followed by a defective

one.

Probability of success (defective transistor) = 0.02 Probability of failure (non-defective

transistor) = 1 - 0.02 = 0.98

Using the geometric distribution formula:

1. where X is the number of trials until the first success (defective transistor).

P(X=10)=(0.98)9×0.02P

Calculate this value to get the probability.

2. Probability that the machine produces no defective transistors in a batch of 100:

This is the probability of having 100 consecutive successful trials (producing

non-defective transistors).
 P(X=100)=(0.98)100

Calculate this value to get the probability.

3. On average, how many transistors would you expect to be produced until the

first with a defect? What is the standard deviation?

For a geometric distribution, the mean (expected value) is given by and the

standard deviation is

4. For the second machine with a 5% defective rate: Follow the same procedure

as in part 3, but with p=0.05.

5. Increasing the probability of success (defective rate) decreases the expected

wait time until success (mean). However, it increases the variability in the

number of trials needed (standard deviation) because the distribution becomes

more spread out.