Problem 1
Open on its own pageIn a competition, the participants are assigned a positive integer score on a scale from to (inclusive). The minimum number of participants required to guarantee that at least three of them achieve the same score is
All 16 problems. Take it as a timed test — 1:20:00 on the clock, scored the way the AMC is — or read through the problems and open any of them for its worked solution.
16 problems · 6 points correct, 1.5 for blank, 0 for wrong
In a competition, the participants are assigned a positive integer score on a scale from to (inclusive). The minimum number of participants required to guarantee that at least three of them achieve the same score is
Alan, Betty, Cece, and Dale are sharing a box of chocolates. They take turns eating one chocolate at a time, and after eating a chocolate, they pass the box to someone among them (other than themselves) who has eaten the fewest chocolates up to that point. After the box is empty, Alan realizes he has eaten four chocolates. The maximum number of chocolates that could have initially been in the box is
In the table, , , , and are integers such that every row and column has the same sum. The value of is
You have two boxes: Box A and Box B. Each box has a square base and is twice as tall as it is wide. Box B is the larger of the two boxes and is two centimeters wider than Box A. If the volume of Box B is greater than the volume of Box A, what is the width in cm of Box A?
The number of integers satisfying is
Oranges cost cents each, and mangoes cost each. You have a gift certificate from the fruit store, and want to use all of it to buy some oranges and mangoes. You want the total cost of the fruit to be as small as possible, provided it is at least . What would be the total cost?
What is the number of integers with for which is an integer?
The number of arrangements of , , , , , , into a single row so that every pair of adjacent numbers in the arrangement has a common factor greater than is
Let with a real number. The smallest possible value of is
An ant is at the point and every second it can move one unit either up or right. However, it can only move to the points where and are not both odd. The number of distinct paths the ant can follow to reach the point is
Jamal writes down an increasing sequence of positive integers, starting with , according to the following procedure:
Step : write down the first two numbers, skip one,
Step : write down the next two numbers, skip two,
Step : write down the next two numbers, skip three,
Step : write down the next two numbers, skip ,
For example, after step , Jamal will so far have written down the numbers , , , , , , , , , . On what step will Jamal first write down a four digit number?
Let , , be positive integers such that . The smallest possible value of is
In a regular polygon the number of triangles having an angle greater than is
Let be a convex quadrilateral whose diagonals and intersect at point . If , and the triangles and have the same area, what is the ratio of the area of over the area of ?
The coefficients of a polynomial are non-negative integers less than . If and then the value of is
In with , is a point on the segment such that . If and then is equal to
0 of 16 answered. Each problem left blank still scores 1.5 points.