Read · 1 min

This is another form of garbage management. Here, we provide tips for understanding definitions, rather than reducing problems to something doable.

To understand a definition, I have two tips: 1) do it piece by piece, 2) try to look at a simpler version of it, with concrete values/objects.

Continue to see an example.

Read · 1 min

For a set S⊂RS\subset \mathbb{R} with x≤Kx\le K ∀x∈S\forall x\in S for some KK, the supremum of SS, or sup⁡S\sup S, is defined as a quantity MM such that ∀ϵ>0\forall \epsilon>0 ∃x∈S\exists x\in S x>M−ϵx>M-\epsilon, but ∀x∈S\forall x\in S x≤Mx\le M.

Try to rephrase the definition of the supremum less incomprehensibly.

Read · 1 min

Read this problem from the 2000 China National Olympiad:

A test contains 55 multiple choice questions which have 44 options in each. Suppose each examinee chose one option for each question. There exists a number nn, such that for any nn sheets among 20002000 sheets of answer papers, there are 44 sheets of answer papers such that any two of them have at most 33 questions with the same answers. Find the minimum value of nn.

Try to understand what this problem wants. After that, show this problem to a friend and test yourself by trying to explain it to her/him.

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems