Answer:
Step-by-step explanation:
1) if according to the condition a₁=3 and r=2/3, then a₁₀ can be calculated as:
a₁₀=a₁*r⁹;
2) according to the rule above:
a₁₀=3*(2/3)⁹=512*3/(6561*3)=512/6561.
Answer:Hillary will pay $35.00 for softball glove, $20.00 for soft ball bat and $40.00 for cleats
Step-by-step explanation:
Step 1
A percentage off of a price of an item is the amount that can be saved from purchasing that item, it can also be referred as a discount given on an item purchase.
Step 2 --- Calculation
Actual Price of Softball glove= $50
Discount= 50 x 30/100 = $15.00
Price to pay= $50 - $15.00 = $35.00
Actual Price of soft ball bat= $50
Discount= 50 x 60/100 = $30.00
Price to pay= $50 - $30.00 = $20.00
Actual Price of cleats= $50
Discount= 50 x 20/100 = $10.00
Price to pay= $50 - $10.00 = $40.00
Therefore, Hillary will pay $35.00 for softball glove, $20.00 for soft ball bat and $40.00 for cleats
Answer: $18.90
Step-by-step explanation:
Note that if we add each side of the 2 equations, y will cancel out:
-12x-y+(17x+y)=6+4
5x=10
x=2
Substituting x=2 in either of the equations, we find the value of y.
Let's use the first equation:
-12x-y=6
-24-y=6
-y=24+6
-y=30, so y=-30.
Thus, the solution is (2, -30)
Answer: C
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)
