MathDB
2017 Combinatorics #7: Frogs and Toads

Source:

February 20, 2017

Problem Statement

There are 20172017 frogs and 20172017 toads in a room. Each frog is friends with exactly 22 distinct toads. Let NN be the number of ways to pair every frog with a toad who is its friend, so that no toad is paired with more than one frog. Let DD be the number of distinct possible values of NN, and let SS be the sum of all possible value of NN. Find the ordered pair (D,S)(D, S).
Back to ProblemsView on AoPS