Search problems

3 problems match “double counting”. Clear

Visitors search a sample. Sign in for free to search every problem. Sign in

  1. Matches in a round-robin group ●○○○○ 10 ptsA group has four teams, and each team plays every other team in the group exactly once. How many matches are played in the group?
  2. Blue segments in a two-colored grid ●●●○○ 50 ptsA 16×1616\times16 square grid of dots is colored red and blue. Two dots that are adjacent in the grid (horizontally or vertically) are joined by a line segment. A segment joining two dots of the same color has that color, and a segment joining dots of different colors is yellow. There are 133 red dots in total. Exactly 2 of the 4 corner dots are red, and 32 other red dots lie on the boundary of the grid (not corners). There are 196 yellow segments in total. How many blue segments are there?
  3. Minimum number of 7-subsets covering all triples ●●●●○ 100 ptsLet S={1,2,…,15}S=\{1,2,\ldots,15\}. Choose nn subsets A1,A2,…,AnA_1,A_2,\ldots,A_n of SS such that: (i) ∣Ai∣=7|A_i|=7 for each ii; (ii) ∣Ai∩Aj∣≤3|A_i\cap A_j|\leq 3 for all 1≤i<j≤n1\leq i<j\leq n; (iii) for every 3-element subset MM of SS, there is some kk with M⊂AkM\subset A_k. Find the minimum possible value of nn.