MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Combinatorial Design Pairwise Triple Constraints

2550MasterCombinatoricsCounting Principles

National Math Olympiad in Slovenia

One day $n$ students participated in a sporting competition with several different disciplines. Exactly $k$ students competed in each discipline, where $3 \le k \le n$. Each pair of students had exactly three disciplines in common, and each triple had exactly two common disciplines. Determine all possible values of $n$ and $k$.
0 students attempted0% solvedRating 2550

Related practice paths

Olympiad-Style PracticeDeep contest practice for proof-style problem solving.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.