suppose there is a sequence of 20 cells, the first cell contains number 1 and the last cell contains 50.we would like to fill all cells with integer number in such a way most k. for which minimal k this is possible?
Answers
Answer:
the other hand and I was a good day of you can do it on a new one gibghb the other day of you can get a to be in the other day of my favorite things that are going to✨ be there for you can get a chance✨✨✨✨ to✨✨✨ be there with you
I emphasized "most" to indicate the actual difference between cells can be 0 up to k, inclusive. However, to determine the smallest possible k, you will only want to increase values instead of not changing them or decreasing them. In particular, you'll want to check what the minimum value of k is such that, using this value for each difference, you'll get to at least 50.
As you've shown, this cannot work for k=2 since the highest possible value of 39, which is less than 50. However, for k=3, you found using that for each difference gets you to 58. Thus, you can reduce the difference in some of the cells so the maximum value reached would be 50, for example by reducing the difference by 1 between any 8 pairs of cells.
This shows the requested answer is k=3.