There are 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 eats a frog with a value , the eaten frog disappears, and the value of the remaining frog changes to .
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 .
Example:
Say , and the values of the frogs are . Then the maximum possible value of the last frog is 4.
A possible way of getting the last frog with value 4 is:
This problem is a part of Tessellate S.T.E.M.S (2019)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
Hi! Thank you for the question. When I needed to resolve such problems, I contacted the guys from this website SameDaPapers.com/write-my-paper-for-me-cheap/ and they offered the best solution with acceptable price. I have received the best grade for my paper.