benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let S={(x,y)|x=1,2,…,1993,y=1,2,3,4}. If T⊂S and there aren't any squares in T. Find the maximum possible value of |T|. The squares in T use points in S as vertices.

Problem

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

problem

Let S={(x,y)|x=1,2,…,1993,y=1,2,3,4}S = \{(x,y) | x = 1, 2, \ldots, 1993, y = 1, 2, 3, 4\}. If T⊂ST \subset S and there aren't any squares in T.T. Find the maximum possible value of |T|.|T|. The squares in T use points in S as vertices.
Plain-text mathematical notation (without MathML)
Let S={(x,y)|x=1,2,…,1993,y=1,2,3,4}. If T⊂S and there aren't any squares in T. Find the maximum possible value of |T|. The squares in T use points in S as vertices.
Original LaTeX notation
Let $S = \{(x,y) | x = 1, 2, \ldots, 1993, y = 1, 2, 3, 4\}$. If $T \subset S$ and there aren't any squares in $T.$ Find the maximum possible value of $|T|.$ The squares in T use points in S as vertices.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

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. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
6562e2f3-6e72-50d3-823f-6068c39904aa
task_key
test--6562e2f3-6e72-50d3-823f-6068c39904aa
task_revision_id
1
config / split
/ test

Official source

initial import