# omnimath / omnimath_3600

- 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

( Elgin Johnston ) Legs $L_1, L_2, L_3, L_4$ of a square table each have  length $n$ , where $n$ is a positive integer.  For how many ordered  4-tuples $(k_1, k_2, k_3, k_4)$ of nonnegative integers can we cut  a piece of length $k_i$ from the end of leg $L_i \; (i = 1,2,3,4)$ and still have a stable table?
(The table is stable if it can be placed so that  all four of the leg ends touch the floor. Note that a cut leg of length 0 is permitted.)

## 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