Answer:
Maximum number of months Abby can learn yoga is 25 months.
Step-by-step explanation:
We have given,
Total savings of Abby = $1325
Total charges to learn yoga is given as:
A fixed registration fee = $35
And a monthly fee = $50
Since the registration Abby pays only once. So we can calculate the remaining saving amount for Abby.
i.e Remaining saving amount after registration fee = $ (1325 - 35) = $1290
Now, from the remaining amount after paying registration fee , let the Abby learn yoga for x months.
To find maximum number of months we need to satisfy a equation given as:
or 
Since we got x ≤ 25.8 months ≈ 25 months (in integer form)
So maximum number of months Abby can learn yoga is 25 months.
Answer:
-3 1/2
Step-by-step explanation:
We have to find the distance between x and z along the y-axis.
This will be: 5 - -6 = 11 units
1/5 of 11 = 1/5 × 11
= 11/5
= 2 1/5
Now add 2.5 to -6
2 1/2 + -6 = -3 1/2
The value of y = -3 1/2
For this problem all you have to do is plug in the value that they is in parenthesis for x. If it says g (x) = x and then it asks g(5) = ?, it is saying what happens if i put 5 in for every x. in this case it would be g (5) = 5. I just replaced x with 5.
So g (-2) we sub -2 for x
g (-2) = -2 (-2)^2 + 3 (-2) - 5
= -2 (4) - 6 - 5
= -19
g (0) = -2 (0) + 3 (0) - 5
= 0 + 0 - t
= -5
g (3) = -2 (3)^2 + 3 (3) - 5
= -18 + 9 - 5
= -14
Any locker with a number that is a multiple of 8, 12, and 75 will contain all three animals.
The least common multiple of these three numbers is
and so any multiples of 600 between 1 and 3500 will contain all three animals. These are 600, 1200, 1800, 2400, and 3000.
Why is the LCM 600? You can determine that using the prime factorizations of the three given numbers:
The LCM can be obtained by multiplying as many prime numbers together as are needed to contain the prime factorizations of the three numbers. This is obtained with
(at least three 2s to get the 8; at least one 3 and two of the previous 2s to get 12; and at least two 5s along with the previous 3 to get 75)
Answer:
C .10
Step-by-step explanation:
