Kevin will start with the integers 1, 2, 3 and 4 each used exactly once and written in a row in any order. then he will find the sum of the adjacent pairs of integers in each row to make a new row, until one integer is left. for example, if he starts with 3, 2, 1, 4, then he takes sums to get 5, 3, 5, followed by 8, 8, and he ends with the final sum 16. including all of kevin's possible starting arrangements of the integers 1, 2, 3 and 4, how many possible final sums are there?

24 final sums, different sums are 16, 18, 20, 22 or 24.

Step-by-step explanation:

First, count how many different orders of 1, 2, 3 and 4 are possible. The first number can be chosen in 4 different ways (it can be any of 4 numbers), the second - in 3 different ways (it can be any of remaining 3 numbers), the third - in 2 different ways (any of remaining 2 numbers) and the last number - in 1 way (only one number left). In total,

different orders.

For each order we can

In total, 6 sums (only 1 of them is final). So, there are 24 final sums.

Different final sums are 16, 18, 20, 22 and 24.

a c

step-by-step explanation:

you need to give us more information since we can't answer