benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / How many ways are there to choose 2010 functions f₁,…,f₂₀₁₀ from …f₂₀₁₀∘f₂₀₀₉∘⋯∘f₁ is constant? Note: a function g is constant if g(a)=g(b) for all a,b in the domain of g. · Discussion

Discussing How many ways are there to choose 2010 functions f₁,…,f₂₀₁₀ from …f₂₀₁₀∘f₂₀₀₉∘⋯∘f₁ is constant? Note: a function g is constant if g(a)=g(b) for all a,b in the domain of g. · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.