3
Problems(4)
Area of marked points on an infinite grid
Source: Romanian 2018 TST Day 1 Problem 3
5/25/2020
Divide the plane into x squares formed by the lattice points. Let be the set-theoretic union of a finite number of such cells, and let be a positive real number less than or equal to 1/4.Show that S can be covered by a finite number of squares satisfying the following three conditions:
1) Each square in the cover is an array of x cells
2) The squares in the cover have pairwise disjoint interios and
3)For each square in the cover the ratio of the area to the area of Q is at least and at most
combinatoricscombinatorial geometryratio
Points covered by strips
Source: Romanian TST 2018 Problem 3 Day 2
5/25/2020
Consider a 4-point configuration in the plane such that every 3 points can be covered by a strip of a unit width. Prove that:
1) the four points can be covered by a strip of length at most and
2)if no strip of length less that covers all the four points, then the points are vertices of a square of length
combinatorial geometrycombinatorics
Cyclic permutation of binary numbers
Source: Romania 2018 TST Problem 3 Day 3
5/25/2020
For every integer let denote the set of all binary -nuples of zeroes and ones, and split into equivalence classes by letting two -nuples be equivalent if one is obtained from the another by a cyclic permutation.(for example 110, 011 and 101 are equivalent). Determine the integers for which splits into an odd number of equivalence classes.
Binarycombinatoricspermutation
Integral part of a sum
Source: Romanian TST 2018 Problem 3 Day 4
5/25/2020
Given an integer determine the integral part of the number
-
floor functionalgebrainequalities