This action might not be possible to undo. Are you sure you want to continue?

February 19, 2005 Individual Round: Combinatorics Subject Test 1. A true-false test has ten questions. If you answer ﬁve questions “true” and ﬁve “false,” your score is guaranteed to be at least four. How many answer keys are there for which this is true? 2. How many nonempty subsets of {1, 2, 3, . . . , 12} have the property that the sum of the largest element and the smallest element is 13? 3. The Red Sox play the Yankees in a best-of-seven series that ends as soon as one team wins four games. Suppose that the probability that the Red Sox win Game n is n−1 . 6 What is the probability that the Red Sox will win the series? 4. In how many ways can 4 purple balls and 4 green balls be placed into a 4 × 4 grid such that every row and column contains one purple ball and one green ball? Only one ball may be placed in each box, and rotations and reﬂections of a single conﬁguration are considered diﬀerent. 5. Doug and Ryan are competing in the 2005 Wiﬄe Ball Home Run Derby. In each round, each player takes a series of swings. Each swing results in either a home run or an out, and an out ends the series. When Doug swings, the probability that he will hit a home run is 1/3. When Ryan swings, the probability that he will hit a home run is 1/2. In one round, what is the probability that Doug will hit more home runs than Ryan hits? 6. Three fair six-sided dice, each numbered 1 through 6, are rolled. What is the probability that the three numbers that come up can form the sides of a triangle? 7. What is the maximum number of bishops that can be placed on an 8 × 8 chessboard such that at most three bishops lie on any diagonal? 8. Every second, Andrea writes down a random digit uniformly chosen from the set {1, 2, 3, 4}. She stops when the last two numbers she has written sum to a prime number. What is the probability that the last number she writes down is 1? 9. Eight coins are arranged in a circle heads up. A move consists of ﬂipping over two adjacent coins. How many diﬀerent sequences of six moves leave the coins alternating heads up and tails up? 10. You start out with a big pile of 32004 cards, with the numbers 1, 2, 3, . . . , 32004 written on them. You arrange the cards into groups of three any way you like; from each group, you keep the card with the largest number and discard the other two. You now again arrange these 32003 remaining cards into groups of three any way you like, and in each group, keep the card with the smallest number and discard the other two. You now have 32002 cards, and you again arrange these into groups of three and keep the largest number in each group. You proceed in this manner, alternating between keeping the largest number and keeping the smallest number in each group, until you have just one card left. How many diﬀerent values are possible for the number on this ﬁnal card? 1

- Problemas de Cálculo
- Notes 06
- 03 Number Theory
- Putnam 2013 b
- 2014 APMO-Application Result_EN
- Nonlinear a Functional Analysis, A First Course - Kesavan
- Lista 1.3
- Polynomials Prasolov
- Analise Alexandre
- 1fase_nivelu_2013.pdf
- 2fase_nivelU_dia1_2012
- Camp2013 Tutorial Linear Algebra
- Camp2013 Tutorial Combinatorics
- Camp2013 Abstract Algebra
- Problems Proposed by Vasc and Arqady - Edited by Sayan Mukherjee
- Combinat or Ics
- A equação do terceiro grau - Elon Lages Lima
- Espaços de Sobolev
- Elliptic
- Problems From the Book
- Det Eval Man
- 24521185 IMOMATH Functional Equations
- Complex Analysis - k Houston
- It a 2001

Sign up to vote on this title

UsefulNot useful- Rich Dad and Poo
- Ch 16 Probability
- Probability
- lot649v3
- Combinatorics & Probability _ GMAT Math Tutorials _ Manhattan GMAT Prep
- probability basics
- Probability
- [솔루션] Probability and Stochastic Processes 2nd Roy D. Yates and David J. Goodman 2판 확률과 통계 솔루션 433 4000
- Birthday Problem
- 08_en
- Pre Calculus Probability
- ch01-posjth
- Sol Manual
- Lecture3_CountingConditional
- Introducing Probability.pdf
- sbe
- Probability
- Complex Probability Measure_Morita Et Al
- Untitled
- Probability
- 514c04
- 0910SEM2-GEK1544
- BinomialPoisson2pp
- Rare Event Probabilities
- Partial Answers
- 01 Introduction
- es2 - countprob - lessons - rev 2016
- Matematik Tambahan Tugasan Suhaimi
- Design of Collapse-resistant Structures
- Notes 509 Fall 11 Sec 31
- pcomb05