Well, you could assign a letter to each piece of luggage like so...
A, B, C, D, E, F, G
What you could then do is set it against a table (a configuration table to be precise) with the same letters, and repeat the process again. If the order of these pieces of luggage also has to be taken into account, you'll end up with more configurations.
My answer and workings are below...
35 arrangements without order taken into consideration, because there are 35 ways in which to select 3 objects from the 7 objects.
210 arrangements (35 x 6) when order is taken into consideration.
*There are 6 ways to configure 3 letters.
Alternative way to solve the problem...
Produce Pascal's triangle. If you want to know how many ways in which you can choose 3 objects from 7, select (7 3) in Pascal's triangle which is equal to 35. Now, there are 6 ways in which to configure 3 objects if you are concerned about order.
Lets x = width
length = x + 4 (4 meters longer than wide)
A = L * W
192 = x ( x +4)
192 = x^2 + 4x
x^2 + 4x - 192 = 0
(x +16)(x-12) = 0
x - 12 = 0, x = 12
x + 16 = 0, x = -16
so width x = 12
length = 12 + 4 = 16 (4 meters longer than wide)
answer. J
16
Answer:
It is the second picture.
Step-by-step explanation:
In this problem we need to find the value of a and b. So given that t<span>he function should be in the form f(n) = an + b and we know each value of n, then out goal is to find a and b.
For getting this purpose, we need to find a system of two equations (given that we have two unknown variables)
Therefore:
(1) f(0) = a(1) + b = 18
</span>∴ a + b = 18
<span>
(2) f(1) = a(2) + b = 24
</span>∴ 2a + b = 24<span>
Solving for a and b we have:
a = 6
b = 12
Finally:
f(n) = 6n + 12</span>