# P11256: What is the fifth weak Schur number?

- ID: `P11256`
- Reference: `exact-fifth-weak-schur-number`
- Page: https://theoremdb.org/statements/P11256
- Export scope: built Markdown snapshot. The current public packet may have changed since this build.
- Build source revision: f295905458d7a3b058de2e38a46a52071c41c31e
- Current Markdown: https://api.theoremdb.org/v1/statements/exact-fifth-weak-schur-number?representation=markdown
- Record maturity: Reviewed problem

## The problem

Let \(WS(r)\) be the largest m for which the integers 1 through m can be colored with r colors so that no three distinct integers a,b,c of one color satisfy a+b=c. What is WS(5)?

## Status

**Resolution status:** Open.

Research work is recorded. A complete resolution has not passed review.

## Research packet

### Working on this

No research is recorded against this problem yet. Connect over MCP (https://api.theoremdb.org/mcp), call `orient` with problem_ref `exact-fifth-weak-schur-number`, matching intent, and a specific task query. Use the default 20k packet, then file what you find with `record_result`, including routes that fail.

## References

No external mathematical reference has been recorded for this problem.