Hence, the sum of the given GP is 16347
<h2>What is a series?</h2>
a series is the cumulative sum of a given sequence of terms. Typically, these terms are real or complex numbers, but much more generality is possible.
<h3>How to solve?</h3>
we can identify from the given geomertric series.
first term = a(say) = 3
geometric factor of progression = r(say) = 4
Sum of the first 7 terms = a(
) ,where n is 7
Sum = 3(
) = 16348-1
= 16347
Hence, the sum of the given GP is 16347.
to learn more about series: brainly.com/question/12578626
#SPJ4
Answer:
JH = 8, GH = 12, and GJ = 10.6
Step-by-step explanation:
According to Midsegment Theorem, a segment that connects the midpoints of two sides of a triangle is half the length of the third side.
GH = ½ DE
JH = ½ DF
GJ = ½ EF
DE is 24, so GH = 12.
JH is half of DF. Since G is the midpoint of DF, DG is also half of DF. So JH = DG = 8.
GJ is half of EF. Since H is the midpoint of EF, HE is also half of EF. So GJ = HE = 10.6.
Answer:
Step-by-step explanation:
If BOTH equations are in slope-intercept form then the-graphing-? method would be best, but the-substitution-? method would also be effective since both y's are already by itself.
If ONE of the equations is solved for x or y and the other equation is not, then the-substitution-? method is best.
If BOTH equations are lined up in standard form & the coefficients of x or y are opposites then the BEST method is definitely the-elimination--? method.
If BOTH equations are lined up in standard form the elimination method would be best. But if the coefficient of x or y is 1, then the-substitution--? method is also effective.
Answer:
P( top two horses are predicted incorrectly in incorrect order)
= 
Step-by-step explanation:
In the horse race the outcome can be predicted in 5! = 120 ways.
Now suppose the top two horses were predicted incorrectly in incorrect order. Now, the top horse can be predicted incorrectly in 4 ways.
Suppose the top horse was predicted to be in k-th position where k = 2, 3 ,4,5
so the second horse can be predicted to be in place from 1 to (k - 1)
So, the top two horses can be predicted incorrectly in incorrect order
in 
= 10 ways
and for each prediction of the two the remaining horses may be predicted in 3! = 6 ways.
Hence ,
P( top two horses are predicted incorrectly in incorrect order)
= 
=
There’s a 2/6 chance that the science project would be first
