Subcontests
(15)Minimally Intersecting
Define an ordered triple (A,B,C) of sets to be minimally intersecting if |A \cap B| \equal{} |B \cap C| \equal{} |C \cap A| \equal{} 1 and A \cap B \cap C \equal{} \emptyset. For example, ({1,2},{2,3},{1,3,4}) is a minimally intersecting triple. Let N be the number of minimally intersecting ordered triples of sets for which each set is a subset of {1,2,3,4,5,6,7}. Find the remainder when N is divided by 1000.
Note: ∣S∣ represents the number of elements in the set S. Two sets
Let N be the number of ordered pairs of nonempty sets A and B that have the following properties:
• \mathcal{A} \cup \mathcal{B} \equal{} \{1,2,3,4,5,6,7,8,9,10,11,12\},
• \mathcal{A} \cap \mathcal{B} \equal{} \emptyset,
• The number of elements of A is not an element of A,
• The number of elements of B is not an element of B.
Find N. Hexagon within the hexagon
Let ABCDEF be a regular hexagon. Let G, H, I, J, K, and L be the midpoints of sides AB, BC, CD, DE, EF, and AF, respectively. The segments AH, BI, CJ, DK, EL, and FG bound a smaller regular hexagon. Let the ratio of the area of the smaller hexagon to the area of ABCDEF be expressed as a fraction nm where m and n are relatively prime positive integers. Find m \plus{} n. T-grid problem
Define a T-grid to be a 3×3 matrix which satisfies the following two properties:
(1) Exactly five of the entries are 1's, and the remaining four entries are 0's.
(2) Among the eight rows, columns, and long diagonals (the long diagonals are {a13,a22,a31} and {a11,a22,a33}, no more than one of the eight has all three entries equal.
Find the number of distinct T-grids. Teams in Card Game
The 52 cards in a deck are numbered 1,2,…,52. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let p(a) be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards a and a\plus{}9, and Dylan picks the other of these two cards. The minimum value of p(a) for which p(a)≥21 can be written as nm. where m and n are relatively prime positive integers. Find m\plus{}n.