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.
Answer:
x= -5/3
Step-by-step explanation:
Move all the terms that don't contain x to the right side and solve.
Hope this helps :)
C: 9 ( = 3^2), 49 ( = 7^2), 81 ( = 9^2)
Answer: 
Step-by-step explanation:
A direct variation equation has the form:

Where <em>k</em> is a constant.
By definition, we know that the perimeter of the square is the sum of the lengths of its sides or, as all the sides are equal, you can multiply the lenght of any side by 4.
Then, knowing that <em>y</em> is the dependent value and <em>x</em> the independent value and the constant <em>k=4, </em> you can write the following direct variation equation that represents the situation.
