olymmath

HMMT 2010 C3

  • Combinatorics
  • Answer

How many ways are there to choose 2010 functions f1,…,f2010f_{1}, \ldots, f_{2010} from {0,1}\{0,1\} to {0,1}\{0,1\} such that f2010∘f2009∘⋯∘f1f_{2010} \circ f_{2009} \circ \cdots \circ f_{1} is constant? Note: a function gg is constant if g(a)=g(b)g(a)=g(b) for all a,ba, b in the domain of gg.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

4^{2010}-2^{2010}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2010/c3 · Tag FXQ4QGHX91 · Edit this page on GitHub · Keys: j next, k previous