Thursday 12 September 2013

Olympiad Aspirants

Avratanu is trying to open a lock whose code is a sequence that is three letters long, with
each of the letters being one of A, B or C, possibly repeated. The lock has three buttons,
labeled A, B and C. When the most recent 3 button-presses form the code, the lock opens.
What is the minimum number of total button presses Avratanu needs to guarantee opening the
lock?

No comments:

Post a Comment

Define \(f: \mathbb{R} \rightarrow \mathbb{R}\) by \[f(x)= \begin{cases}(1-\cos x) \sin \left(\frac{1}{x}\right), & x \neq 0 \\ 0, &a...