Two runners are saving money to attend a marathon. The first runner has $112 in savings, received a $45 gift from a friend, and
2 answers:
Answer:
The correct answer is the last option, that is,
Step-by-step explanation:
We have been given that the first runner has $112 in savings, received a $45 gift from a friend, and will save $25 each month. Therefore, amount of money in the account of first running after m months will be:
We have been given that the second runner has $50 in savings and will save $60 each month. Therefore, amount of money in the account of second running after m months will be:
In order for amount of money to be equal in accounts of both the runners, we set up:
Upon rewriting the left hand side using commutative law, we get:
Therefore, we can see that the last option is the correct answer.
You might be interested in
To find out the largest number of snack bags that Rashad could make, we need to find the GCF of 24 and 56
Because,
GCF of 24 and 56 is the largest possible number that divides 24 and 56 exactly without any remainder. The factors of 24 and 56 are 1, 2, 3, 4, 6, 8, 12, 24 and 1, 2, 4, 7, 8, 14, 28, 56 respectively.
There are 3 commonly used methods to find the GCF of 24 and 56 - long division, Euclidean algorithm, and prime factorization.
By Prime factorisation :
Prime factorization of 24 and 56 is (2 × 2 × 2 × 3) and (2 × 2 × 2 × 7) respectively.
As visible, 24 and 56 have common prime factors. Hence, the GCF of 24 and 56 is 2 × 2 × 2 = 8.
By Euclidean algorithm :
As per the Euclidean Algorithm, GCF(X, Y) = GCF(Y, X mod Y) where X > Y and mod is the modulo operator.
Here X = 56 and Y = 24
- GCF(56, 24) = GCF(24, 56 mod 24) = GCF(24, 8)
- GCF(24, 8) = GCF(8, 24 mod 8) = GCF(8, 0)
- GCF(8, 0) = 8 (∵ GCF(X, 0) = |X|, where X ≠ 0)
Therefore, the value of GCF of 24 and 56 is 8.
By Long division :
GCF of 24 and 56 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.
- Step 1: Divide 56 (larger number) by 24 (smaller number).
- Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (24) by the remainder (8).
- Step 3: Repeat this process until the remainder = 0.
The corresponding divisor (8) is the GCF of 24 and 56.
Hence,
Hence,Rashad can make 8 snack bags
Learn more about GCF at : brainly.com/question/11444998
#SPJ4
Answer:
(1, -7)
Step-by-step explanation:
P(3,4)
3 up ---> y = 4 + 3 = 7
2 left ----> x = 3 - 2 = 1
new point (1, 7)
after 180 rotation around origin
point is (-1, -7)
now reflection over y-axis
(1, -7)
