There are \(n\) frogs in a row. Each frog has an integer value (possibly negative or zero) associated with it. Any frog can eat its adjacent frog (the closest frog to its left or to its right, assuming that this frog exists). When a frog with a value \(x\) eats a frog with a value \(y\), the eaten frog disappears, and the value of the remaining frog changes to \(x-y\).

The frogs will eat each other until there is only one frog left.

Can you give a formula(based on the initial values) to obtain the maximum possible value of the last frog.

Assume the initial values to be \(a_{1},a_{2},...,a_{n}\).

**Example:**

Say \(n = 4\), and the values of the frogs are \({2,1,2,1}\). Then the maximum possible value of the last frog is 4.

A possible way of getting the last frog with value 4 is:

- Second frog eats the third frog, the row now contains \({2,-1,1}\)
- Second frog eats the third frog, the row now contains \({2,-2}\)
- First frog eats the second frog, the row now contains \({4}\)

This problem is a part of Tessellate S.T.E.M.S (2019)

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.