MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Minimum Triangles Covering All Chords

2425MasterGraph TheoryCombinatorics

China Southeastern Mathematical Olympiad

There are given 12 red points on a circle. Find the minimum of $n$, such that there exist $n$ triangles, whose vertices are red points, satisfying every chord with red endpoints being a side of one triangle. (Posed by Tao Pingsheng)
0 students attempted0% solvedRating 2425

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.