General term of a geometric sequence is
a(n)=a(1)×r^(n-1)
a1=5
a2=5×6=30
a3=5×6²=180
a4=5×6³=1080
Answer:
c, e, f, and i
Step-by-step explanation:
a. is bounded above at y = 1 and below at y = 0
b. is unbounded both above and below
c. is bounded below at y = 0 and unbounded above
d. is unbounded both above and below
e. is bounded below at y = 0 and unbounded above
f. is bounded below at y = 0 and unbounded above
g. is bounded below at y = 0 and bounded above at y = 1
h. is unbounded both above and below
i. is bounded below at y = 0 and unbounded above
j. is unbounded both above and below
Step-by-step explanation:
given
3x + y = 9
Writing In slope intercept form , y = mx + c
y = -3x + 9
comparing the given equation with y = mx + c
slope (m) = - 3
y-intercept (c) = 9
Hope it will help :)
2 and 3/5 + 1 and 1/8
First, find the LCM of 5 and 8: 40
Next, make equivalent fractions:
2 and 24/40 + 1 and 5/40= 3 and 29/40
Answer: 3 and 29/40
Answer:
"greatest common factor" (GCF) or "greatest common divisor" (GCD)
Step-by-step explanation:
Apparently, you're looking for the term that has the given definition. It is called the GCF or GCD, the "greatest common factor" or the "greatest common divisor."
_____
The GCF or GCD can be found a couple of ways. One way is to find the prime factors of the numbers involved, then identify the lowest power of each of the unique prime factors that are common to all numbers. The product of those numbers is the GCF.
<u>Example</u>:
GCF(6, 9)
can be found from the prime factors:
The unique factors are 2 and 3. Only the factor 3 is common to both numbers, and its lowest power is 1. Thus ...
GCF(6, 9) = 3¹ = 3
__
Another way to find the GCD is to use Euclid's Algorithm. At each step of the algorithm, the largest number modulo the smallest number is found. If that is not zero, the largest number is replaced by the result, and the process repeated. If the result is zero, the smallest number is the GCD.
GCD(6, 9) = 9 mod 6 = 3 . . . . . (6 mod 3 = 0, so 3 is the GCD)
