Here, what we want to find is the lowest number of bottles / soaps while having the total inventory used. As we want the number of bottles and soaps to fit perfectly, we have to find a common divisor of 48 and 64. In addition, since we want the maximum number of baskets, we want to find the highest common divisor of the two numbers. Using a little guess and check, we can find 16 baskets as our answer. To have the same number of soaps and lotions in each, we have 48/16= 3 soaps per basket and 64/16=4 lotions per basket.
Feel free to contact me with further questions.
Answer: a ≤ 4 or (-∞, 4]
Step-by-step explanation:
Here we have the inequality:
4a ≤ 16
this means that the left sides is less or equal than the right side.
First, find the equal part:
4*a = 16
a = 16/4 = 4
So the maximum possible value of a is 4.
Now, all the values of a smaller than 4 also make the inequality true (even the negative values) so the possible values of a are:
a ≤ 4 or (-∞, 4]
5x - 3y = 9
5x = 9 + 3y
5x - 9 = 3y
( 5x - 9 ) / 3 = y
y = ( 5 / 3x ) - ( 9 / 3 ) ( I just split the common denominator to individual parts )
y = 5 / 3x - 3
Answer:
Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1?
3, –6, 12, –24, 48, …
f (n + 1) = –3 f(n )
f (n + 1) = 3 f(n )
f (n + 1) = –2 f(n )
f (n + 1) = 2 f(n)
Step-by-step explanation: