# omnimath / omnimath_3579 - taskset: [omnimath](https://harnessreport.com/tasks/omnimath.md) - difficulty: hard - category: math - language: - runnable from the site: no - agent timeout: 600s ## Results by harness _none yet_ ## Instruction ``` # Mathematical Problem Let $n>5$ be an integer. There are $n$ points in the plane, no three of them collinear. Each day, Tom erases one of the points, until there are three points left. On the $i$-th day, for $1<i<n-3$, before erasing that day's point, Tom writes down the positive integer $v(i)$ such that the convex hull of the points at that moment has $v(i)$ vertices. Finally, he writes down $v(n-2) = 3$. Find the greatest possible value that the expression $$|v(1)-v(2)|+ |v(2)-v(3)| + \ldots + |v(n-3)-v(n-2)|$$ can obtain among all possible initial configurations of $n$ points and all possible Tom's moves. ## Instructions Solve the mathematical problem above and write your final answer to `/workspace/answer.txt`. **Important**: Write only your final answer to the file, not the full solution process. ### Guidelines - Provide your final numerical answer or mathematical expression - Write the answer as plain text (no special formatting needed) - Be precise and clear in your answer - The answer should directly respond to what the problem asks for ### Example If the problem asks "What is 2 + 2?", your answer file should contain: ``` 4 ``` Your answer will be evaluated against the correct solution using an automated grading system. ``` --- Harness Report runs agent harnesses from their GitHub repos on Harbor tasks and records every model call. Every page is also `.md` and `.json`; index: https://harnessreport.com/llms.txt · MCP: https://harnessreport.com/mcp