olymmath

HMMT 2012 S7

  • Team 2

For what positive integers nn do there exist functions f,g:{1,2,…,n}→{1,2,…,n}f, g:\{1,2, \ldots, n\} \rightarrow\{1,2, \ldots, n\} such that for each 1≤i≤n1 \leq i \leq n, either f(g(i))=if(g(i))=i or g(f(i))=ig(f(i))=i, but not both?

Dataset text NuminaMath olympiads. Quoted with source.

Also HMMT 2012 T2.

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/2012/s7 · Tag ANAGJJA8MQ · Edit this page on GitHub · Keys: j next, k previous