uniolympiads Ελληνικά

Subject

Geometry

Analytic and convex geometry, geometric arguments.

Contest problems, from easiest to hardest

  1. IMC 2006, Day 2, Problem 1Let V be a convex polygon with n vertices. (a) Prove that if n is divisible by 3 then V…
  2. IMC 2002, Day 1, Problem 1A standard parabola is the graph of a quadratic polynomial y = x 2 + ax + b with…
  3. IMC 2026, Day 2, Problem 7For a continuous function f : [0,1] → R, let S(f) be the union of all straight segments…
  4. IMC 2022, Day 2, Problem 5We colour all the sides and diagonals of a regular polygon P with 43 vertices either…
  5. IMC 2009, Day 2, Problem 1Let ℓ be a line and P a point in R 3 . Let S be the set of points X such that the…
  6. IMC 2023, Day 2, Problem 8Let T be a tree with n vertices; that is, a connected simple graph on n vertices that…
  7. IMC 2004, Day 2, Problem 33. Let D be the closed unit disk in the plane, and let p 1 , p 2 , . . . , p n be fixed…
  8. IMC 2004, Day 1, Problem 4Suppose n ≥ 4 and let M be a finite set of n points in R 3 , no four of which lie in a…
  9. IMC 2001, Day 2, Problem 3Find the maximum number of points on a sphere of radius 1 in R n √ such that the…
  10. IMC 1996, Day 2, Problem 4(20 points) Let B be a bounded closed convex symmetric (with respect to the origin) set…
  11. IMC 1995, Day 2, Problem 3(15 points) Let all roots of an n-th degree polynomial P (z) with complex coefficients…
  12. IMC 2023, Day 2, Problem 9We say that a real number V is good if there exist two closed convex subsets X, Y of…
  13. IMC 2020, Day 1, Problem 3Let d ≥ 2 be an integer. Prove that there exists a constant C(d) such that the…
  14. IMC 1998, Day 2, Problem 5(20 points) Suppose that S is a family of spheres (i.e., surfaces of balls of positive…
  15. IMC 2026, Day 2, Problem 10An infinite chessboard of size d > 0 is obtained by colouring the interiors of the…
  16. IMC 2024, Day 1, Problem 5Let n > d be positive integers. Choose n independent, uniformly distributed random…
  17. IMC 2022, Day 2, Problem 8Let n, k ≥ 3 be integers, and let S be a circle. Let n blue points and k red points be…
  18. IMC 2019, Day 2, Problem 102019 points are chosen at random, independently, and distributed uniformly in the unit…
  19. IMC 2018, Day 1, Problem 5Let p and q be prime numbers with p < q . Suppose that in a convex polygon P 1 P 2 . .…
  20. IMC 2017, Day 2, Problem 10Let K be an equilateral triangle in the plane. Prove that for every p > 0 there exists…
  21. IMC 2015, Day 1, Problem 5Let n ≥ 2 , let A 1 , A 2 , . . . , A n+1 be n + 1 points in the n -dimensional…
  22. IMC 2014, Day 1, Problem 5Let A 1 A 2 . . . A 3n be a losed broken line onsisting of 3n line segments in the Eu…
  23. IMC 2011, Day 2, Problem 5Let F = A 0 A 1 . . . A n be a convex polygon in the plane. Define for all 1 ≤ k ≤ n −…
  24. IMC 2009, Day 1, Problem 5Let n be a positive integer. An n-simplex in R n is given by n + 1 points P 0 , P 1 , .…
  25. IMC 2008, Day 2, Problem 6Let H be an infinite-dimensional real Hilbert space, let d > 0, and suppose that S is a…
  26. IMC 2003, Day 1, Problem 66. Let f (z) = a n z n + a n−1 z n−1 + . . . + a 1 z + a 0 be a polynomial with real…
  27. IMC 2002, Day 2, Problem 6Let f : R n → R be a convex function whose gradient ∇f = ∂f ∂f n ∂x 1 , . . . , ∂x n…
  28. IMC 1996, Day 1, Problem 6(25 points) Upper content of a subset E of the plane R 2 is defined as C(E) = inf ( n X…