140Mathematics · Counting and probability

Success counts in three independent events

Success counts in three independent events

Three mutually independent trials have the probabilities p₁,p₂,p₃ below, which need not be equal. If K counts successes, find P(L≤K≤U), including both endpoints.

  • 249 bytes
  • COMP mode
01

Worked examples

Example 1

Original exercise 1. Three mutually independent trials have the probabilities p₁,p₂,p₃ below, which need not be equal. If K counts successes, find P(L≤K≤U), including both endpoints. Data: A=p₁, probability = 0.4; B=p₂, probability = 0.6; C=p₃, probability = 0.25; X=L, lower bound = 1; Y=U, upper bound = 3.

  1. (a)Calculate all requested quantities in the stated order. Output order: P(L≤K≤U).
Answer
P=41/50=0.82.
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data. P(K=0)=(1−p₁)(1−p₂)(1−p₃).
  2. Written solution: (1−p₁,1−p₂,1−p₃)=(3/5,2/5,3/4).
  3. P(K=0)=9/50; P(K=1)=9/20; P(K=2)=31/100; P(K=3)=3/50.
  4. P(1≤K≤3)=(9/20)+(31/100)+(3/50)=41/50.
  5. Retain exact fractions in written work; round only the final answer.
Do it on the calculator

Example 2

Original exercise 2. Three mutually independent trials have the probabilities p₁,p₂,p₃ below, which need not be equal. If K counts successes, find P(L≤K≤U), including both endpoints. Data: A=p₁, probability = 0.25; B=p₂, probability = 0.5; C=p₃, probability = 0.75; X=L, lower bound = 2; Y=U, upper bound = 2.

  1. (a)Calculate all requested quantities in the stated order. Output order: P(L≤K≤U).
Answer
P=13/32=0.40625.
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data. P(K=0)=(1−p₁)(1−p₂)(1−p₃).
  2. Written solution: (1−p₁,1−p₂,1−p₃)=(3/4,1/2,1/4).
  3. P(K=0)=3/32; P(K=1)=13/32; P(K=2)=13/32; P(K=3)=3/32.
  4. P(2≤K≤2)=(13/32)=13/32.
  5. Retain exact fractions in written work; round only the final answer.
Do it on the calculator

Example 3

Original exercise 3. Three mutually independent trials have the probabilities p₁,p₂,p₃ below, which need not be equal. If K counts successes, find P(L≤K≤U), including both endpoints. Data: A=p₁, probability = 0.1; B=p₂, probability = 0.3; C=p₃, probability = 0.9; X=L, lower bound = 0; Y=U, upper bound = 1.

  1. (a)Calculate all requested quantities in the stated order. Output order: P(L≤K≤U).
Answer
P=83/125=0.664.
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data. P(K=0)=(1−p₁)(1−p₂)(1−p₃).
  2. Written solution: (1−p₁,1−p₂,1−p₃)=(9/10,7/10,1/10).
  3. P(K=0)=63/1000; P(K=1)=601/1000; P(K=2)=309/1000; P(K=3)=27/1000.
  4. P(0≤K≤1)=(63/1000)+(601/1000)=83/125.
  5. Retain exact fractions in written work; round only the final answer.
Do it on the calculator
02

When to use it

Three mutually independent trials have the probabilities p₁,p₂,p₃ below, which need not be equal. If K counts successes, find P(L≤K≤U), including both endpoints.

Input order

  • A=p₁, probability
  • B=p₂, probability
  • C=p₃, probability
  • X=L, lower bound
  • Y=U, upper bound
  • Every displayed input is required unless a blank is explicitly specified. Empty EXE keeps a stored value, whereas typing 0 replaces it with zero. The listed domain conditions must be checked even when the program does not test all of them.

Output order

  • P(L≤K≤U)
  • Record the value and press EXE.
  • The program has ended. Press AC to leave; EXE runs it again.

Conditions and limitations

  • 0≤p₁,p₂,p₃≤1; L,U∈{0,1,2,3}; L≤U.
  • P(K=0)=∏(1−pⱼ); P(K=3)=∏pⱼ.
  • −1: pⱼ∉[0,1] / L,U∉{0,1,2,3} / L>U.
  • Every displayed input is required unless a blank is explicitly specified. Empty EXE keeps a stored value, whereas typing 0 replaces it with zero. The listed domain conditions must be checked even when the program does not test all of them.
  • Use consistent units throughout.
  • Finite precision can lose small differences between large numbers or probabilities extremely near 0 or 1. An error marker is never a valid answer.

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.

Checking access…

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.