MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Minimum Lines Cutting All Rays

2300ExpertCombinatoricsGeometry

PRÉPARATION OLYMPIQUE FRANÇAISE DE MATHÉMATIQUES

Let $k$ be a positive integer and $P$ a point in the plane. Determine the smallest integer $n$ with the following property: one can draw $n$ lines not passing through $P$ such that every ray starting at $P$ intersects at least $k$ lines.
0 students attempted0% solvedRating 2300

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.