Answer:
It should be -5/2 for the points (-6,8) (-16,33)
Step-by-step explanation:
The partial sum of a geometric sequence is
In your case a=3, so if we sum N terms of the sequence we have
We want this to me more than 1 million, so we have
Considering the log (base 3) of both sides, we have
So, starting from N=13, the sum of the first N terms will be more than 1 million
The answer is: x = 7 - √53 or x = 7 + √53
The general quadratic equation is: ax² + bx + c =
0.
But, by completing the square we turn it into: a(x + d)² + e = 0, where:<span>
d = b/2a
e = c - b²/4a
Our quadratic equation is x² - 14x -4 = 0, which is
after rearrangement:
So, a = 1, b = -14, c = -4
Let's first calculate d and e:
d = b/2a = -14/2*1 = -14/2 = -7
e = c - b²/4a = -4 - (-14)</span>²/4*1 = -4 - 196/4 = -4 - 49 = -53<span>
By completing the square we have:
a(x + d)² + e = 0
1(x + (-7))</span>² + (-53) = 0
(x - 7)² - 53 = 0
(x - 7)² = 53
x - 7 = +/-√53
x = 7 +/- √53
Therefore, the solutions are:
x = 7 - √53
or
x = 7 + √53
If a catering company provided 18 bottles of soda and 30 bottles on a table at a party then they may cover atmost 6 number of tables if they wanted table have the same number of each type of bottle with no bottle flip diver.
Given that a catering company provided 18 bottles of soda and 30 bottles on a table at a party they wanted table have the same number of each type of bottle with no bottle flip diver.
To find the greatest number of tables we need to find the H.C.F of 18 and 30.
18=2*3*3*1
30=2*3*5*1
H.C.F=2*3
H.C.F=6
Hence if a catering company provided 18 bottles of soda and 30 bottles on a table at a party then they may cover atmost 6 number of tables if they wanted table have the same number of each type of bottle with no bottle flip diver.
Learn more about H.C.F at brainly.com/question/21504246
#SPJ9
