This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 27

1999 All-Russian Olympiad, 5
Tags: complementary counting , combinatorics
An equilateral triangle of side $n$ is divided into equilateral triangles of side $1$. Find the greatest possible number of unit segments with endpoints at vertices of the small triangles that can be chosen so that no three of them are sides of a single triangle.

2010 AMC 8, 25
Tags: probability , complementary counting
Everyday at school, Jo climbs a flight of $6$ stairs. Joe can take the stairs $1,2$, or $3$ at a time. For example, Jo could climb $3$, then $1$, then $2$. In how many ways can Jo climb the stairs? $ \textbf{(A)}\ 13 \qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 24 $