Find the distance of each trip:
68 km / 34 trips = 2 km per trip
Divide total distance by distance per trip:
348 km / 2 km per trip = 174 trips
Answer: 174 trips
For this problem, all you need to do is find the three #'s that add up to 156.
So, lets look at the answers and add them up.
A. 50, 52, 54
50 + 52 + 54 = 156
B. 51,52,53
51 + 52 + 53 = 156
C. 49,50,51
49 + 50 + 51 = 150
D. 49,51,53
49 + 51 + 53 = 153
We get the answers (50,52,54) and (51,52,53)
Now, consecutive numbers are numbers that in order, like 1,2,3.
Therefore, the answer is (51,52,53)
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: below
Step-by-step explanation: Given f(x) =kxn where k is a constant, then f'(x) = nkx(n - 1)
Can you apply this principle to this problem, Let me know if you have any further questions about this problem. Thanks.
Upvote
1
Downvote
Add comment