Linked and Independent Sets
Problem
For with : if contains four distinct elements with , call linked and a linked subset; otherwise call independent.
1. Are and linked or independent? For linked ones, list all linked subsets. 2. Suppose is linked, and every pair is contained in some linked subset of . Prove that form an arithmetic progression. 3. If is independent, prove that some satisfies .
Answer
Solution
| Difficulty | 9/10 |
|---|---|
| Topics | combinatorics, Arithmetic Progression, number theory, Set Theory, Casework |
Whiteboard
Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.
Discussion
Ask questions, share alternate solutions, and use LaTeX freely.
Log in to join the discussion.
No comments yet.