12xy i think lol :) hope that helps a bit
The answer would most likely be C
Write a recursive rule for the sequence.
-2,0,2,4,6
STEP 1:
a1 = -2
a2 = 0
a3 = 2
STEP 2:
d = a2-(a1)=a3
= d = 0-(-2)=2
STEP 3:
An = a+(n-1)d
ANS:
Answer:
23%
Step-by-step explanation:
To find how many failed inspection, add together all the percentages:
15 + 5 + 3
= 23
So, 23% of the products failed inspection
Answer:
Step-by-step explanation:
<u>Given number:</u>
<u>Prime factors of 19683:</u>
- 19683 = 3 × 3 × 3 × 3 × 3 × 3 × 3 × 3 × 3 = 3^9
<u>Cube root:</u>