Combinatorics, Combinatorial Geometry
Combinatorial Geometry explores the connections between combinatorics and geometry. It deals with problems about arrangements, configurations, and properties of discrete geometric objects (points, lines, polygons). Questions often involve counting, existence proofs, and geometric inequalities.
Cut a Shape / Dissection Problems Grid Paper Geometry / Lattice Geometry-
Question
A square is divided into several convex polygons (more than `1`), each of which has a different number of sides. Prove that among these polygons there is a triangle.
Topics:Combinatorics -> Pigeonhole Principle Combinatorics -> Combinatorial Geometry Combinatorics -> Graph Theory Geometry -> Plane Geometry -> Triangles Proof and Example -> Proof by Contradiction Geometry -> Solid Geometry / Geometry in Space -> Polyhedra Minimum and Maximum Problems / Optimization Problems -
Question
A plane is colored with two colors (that is, every point on the plane is colored with one of these two colors). Prove that there exist two points on the plane at a distance of `1` such that they are both the same color.
-
Question
Shlomi has a chessboard and a cube whose face size is the same as the size of a square on the board. Shlomi wants to paint the faces of the cube black and white, and then roll the cube across the board so that each time the face touching the board is the same color as the square it touches. The cube is supposed to pass through each square on the board exactly once. Can Shlomi do this? Justify or provide an example.
-
Question
The plane is divided by n lines and circles.
Prove that the resulting map can be colored with two colors such that any two adjacent regions (separated by a segment or an arc) are colored with different colors.
Sources: -
Question
Inside a square with side length 1, `n>=101` points are marked, such that no three are collinear. A triangle is called marked if its vertices are marked points. Prove that the area of one of the marked triangles is less than `1/100`
Sources: -
Question
Given an infinite grid whose vertices are colored with two colors, blue and red. Prove that there exist two horizontal lines and two vertical lines such that their four intersection points are colored with the same color.
Sources:Topics:Combinatorics -> Pigeonhole Principle Combinatorics -> Combinatorial Geometry Geometry -> Plane Geometry Combinatorics -> Colorings- Zebra Exercises, 2018-2019, Exercise 1 Question 1
-
The Grasshopper
Consider an infinite grid of squares. A grasshopper sits on one of the squares. The grasshopper can jump two squares in any horizontal or vertical direction, and it can jump to the adjacent square diagonally. Can the grasshopper ever reach a square that is adjacent to its starting square by a side?
Sources:Topics:Combinatorics -> Combinatorial Geometry Combinatorics -> Invariants Combinatorics -> Colorings -> Chessboard Coloring -
More Game Cubes
Aviv has game cubes, where two opposite faces of each are painted red and the rest are blue.
Sources:
Aviv glued together a `3 xx 3 xx 3` cube from the game cubes. Then his friend Kfir came and calculated the total red area on the surface of the large cube.
What is the largest result Kfir can get? -
5 Lines, 8 Intersections
Draw 5 lines such that there are exactly 8 points of intersection between them.
Sources: -
Star of David in a Circle
Eight points are given on a circle. In how many different ways can a Star of David be drawn with vertices at these points?
Note: A Star of David is a figure obtained when two triangles intersect and their sides create exactly 6 intersection points.
Sources: