Benchmark AI / Public workspace

OlympiadBench / 1664 / Find all positive integers n, for which the numbers in the set …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

answer type

Numerical

is multiple answer

true

language

English

question

Find all positive integers nn, for which the numbers in the set S={1,2,,n}S=\{1,2, \ldots, n\} can be colored red and blue, with the following condition being satisfied: the set S×S×SS \times S \times S contains exactly 2007 ordered triples (x,y,z)(x, y, z) such that (i) x,y,zx, y, z are of the same color and (ii) x+y+zx+y+z is divisible by nn.
Plain-text mathematical notation (without MathML)
Find all positive integers n, for which the numbers in the set S={1,2,…,n} can be colored red and blue, with the following condition being satisfied: the set S×S×S contains exactly 2007 ordered triples (x,y,z) such that (i) x,y,z are of the same color and (ii) x+y+z is divisible by n.
Original LaTeX notation
Find all positive integers $n$, for which the numbers in the set $S=\{1,2, \ldots, n\}$ can be colored red and blue, with the following condition being satisfied: the set $S \times S \times S$ contains exactly 2007 ordered triples $(x, y, z)$ such that (i) $x, y, z$ are of the same color and (ii) $x+y+z$ is divisible by $n$.

question type

Open-ended

subject

Math

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import