# omnimath / omnimath_2993

- 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

We call the pair $(m, n)$ of positive integers a happy pair if the greatest common divisor of $m$ and $n$ is a perfect square. For example, $(20, 24)$ is a happy pair because the greatest common divisor of 20 and 24 is 4. Suppose that $k$ is a positive integer such that $(205800, 35k)$ is a happy pair. What is the number of possible values of $k$ with $k \leq 2940$?

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