Here is a pattern of dots.
1 answer:
The dots in the patterns are illustrations of a sequence or progression
- The number of dots in step 10 is 84
- The number of dots in step n is (n -1)^2+ 3
From the pattern, we have:
- Step 0 = 3 dots
- Step 1 = 4 dots
- Step 2 = 7 dots
- Step 3 = 12 dots
So, we have the following pattern
When n = 10, we have:
T10 = 84
This means that, there will be 84 dots in step 10 and there will be (n -1)^2+ 3 dots in step n
Read more about sequence at:
You might be interested in
Answer:
(a)0.16
(b)0.588
(c)
Step-by-step explanation:
The matrix below shows the transition probabilities of the state of the system.
(a)To determine the probability of the system being down or running after any k hours, we determine the kth state matrix .
(a)
If the system is initially running, the probability of the system being down in the next hour of operation is the
The probability of the system being down in the next hour of operation = 0.16
(b)After two(periods) hours, the transition matrix is:
Therefore, the probability that a system initially in the down-state is running
is 0.588.
(c)The steady-state probability of a Markov Chain is a matrix S such that SP=S.
Since we have two states,
Using a calculator to raise matrix P to large numbers, we find that the value of approaches [0.75 0.25]:
Furthermore,
The steady-state probabilities of the system being in the running state and in the down-state is therefore:
Answer:
(f+g)(x)=5x²-4x+3
(f-g)(x)=3x²-2x+3
(fg)(x)
Step-by-step explanation:
Given that,
f(x)=4x²-3x
g(x)=x²-x+3
(f+g)(x)
=f(x)+g(x)
=4x²-3x+x²-x+3
=(4x²+x²)+(-3x-x)+3 [ combined the like terms]
=5x²-4x+3
(f-g)(x)
=f(x)-g(x)
=4x²-3x-(x²-x+3)
=4x²-3x-x²+x-3
=(4x²-x²)+(-3x+x)-3 [ combined the like terms]
=3x²-2x+3
(fg)(x)
=f(x).g(x)
=(4x²-3x).(x²-x+3)
=4x²(x²-x+3)-3x(x²-x+3)