Scribd
Upload
135 views1 page

Combinatorics AIME

The document presents a set of combinatorial problems related to probability, permutations, paths in networks, arithmetic sequences, tournament scoring, coordinate movements, integer arrays, expected values, partitions of numbers, and labeling points on a circle. Each problem requires mathematical reasoning and problem-solving skills to derive specific numerical answers. The problems are structured to challenge the reader's understanding of combinatorics and related concepts.

Uploaded by

Mamat Rahmat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
135 views1 page

Combinatorics AIME

The document presents a set of combinatorial problems related to probability, permutations, paths in networks, arithmetic sequences, tournament scoring, coordinate movements, integer arrays, expected values, partitions of numbers, and labeling points on a circle. Each problem requires mathematical reasoning and problem-solving skills to derive specific numerical answers. The problems are structured to challenge the reader's understanding of combinatorics and related concepts.

Uploaded by

Mamat Rahmat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

David Altizio AIME Practice Set 2015 Page 3

2 Combinatorics
1. A random pizza is made by flipping a fair coin to decide whether to include pepperoni, then doing the same
for sausage, mushrooms, and onions. The probability that two random pizzas have at least one topping in
common can be written in the form mn where m and n are positive integers. Find m + n.

2. How many permutations (a1 , a2 , . . . , a10 ) of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 satisfy

|a1 − 1| + |a2 − 2| + · · · + |a10 − 10| = 4?

A
3. How many paths are there from A to B through the network shown if you
may only move up, down, right, and up-right? A path also may not traverse
any portion of the network more than once. A sample path is highlighted.

4. Consider the set S = {1, 2, 3, 4, 5, . . . , 100}. How many subsets of this set with two or more elements satisfy:
(i) the terms of the subset form an arithmetic sequence, and
(ii) we cannot include another element from S with this subset to form an even longer arithmetic sequence?
5. Simon and Garfunkle play in a round-robin golf tournament. Each player is awarded one point for a victory,
a half point for a tie, and no points for a loss. Simon beat Garfunkle in the first game by a record margin as
Garfunkle sent a shot over the bridge and into troubled waters on the final hole. Garfunkle went on to score
8 total victories, but no ties at all. Meanwhile, Simon wound up with exactly 8 points, including the point for
a victory over Garfunkle. Amazingly, every other player at the tournament scored exactly n. Find the sum
of all possible values of n.

6. An ant starts at the origin of a coordinate plane. Each minute, it either walks one unit to the right or one
unit up, but it will never move in the same direction more than twice in the row. In how many different ways
can it get to the point (5,5)?
7. Thaddeus is given a 2013 × 2013 array of integers each between 1 and 2013, inclusive. He is allowed two
operations:

1. Choose a row, and subtract 1 from each entry.


2. Chooses a column, and add 1 to each entry.

He would like to get an array where all integers are divisible by 2013. Let M be the number of initial arrays
for which this is possible. What is the number formed by the last three digits of M ?

8. If you flip a fair coin 1000 times, let P be the expected value of the product of the number of heads and the
number of tails. What are the first three digits of P ?
9. Suppose N is the number of ways to partition the counting numbers from 1 to 12 (inclusive) into four sets
with three numbers in each set so that the product of the numbers in each set is divisible by 6. What is the
number formed by the last three digits of N ?

10. Seven points are spaced equally around a circle each having labeled with some number. A labeling is clean
if for any two pairs of points a, b and c, d with a having the same label as b and c as d, but a not having the
same label as c, the chords connecting ab and cd do not intersect. Additionally, two clean labelings are the
same if the set of points that have the same label in one labeling are the same as in the other and if the points
can be rotated to equal the other. How many unique clean labelings are there?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy