# omnimath / omnimath_1536

- 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

In a game, \(N\) people are in a room. Each of them simultaneously writes down an integer between 0 and 100 inclusive. A person wins the game if their number is exactly two-thirds of the average of all the numbers written down. There can be multiple winners or no winners in this game. Let \(m\) be the maximum possible number such that it is possible to win the game by writing down \(m\). Find the smallest possible value of \(N\) for which it is possible to win the game by writing down \(m\) in a room of \(N\) people.

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