Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2000 AMC 10 Problems"

m (→‎Problem 21)
(→‎Problem 23)
 
(17 intermediate revisions by 11 users not shown)
Line 1: Line 1:
 
{{AMC10 Problems|year=2000|ab=}}
 
{{AMC10 Problems|year=2000|ab=}}
−
==Problem 1==
 
  
−
In the year 2001, the United States will host the International Mathematical Olympiad. Let <math>I</math>, <math>M</math>, and <math>O</math> be distinct positive integers such that the product <math>I \cdot M \cdot O = 2001</math>. What is the largest possible value of the sum <math>I + M + O</math>?
+
 
 +
 
 +
 
 +
 
 +
== Problem 1 ==
 +
 
 +
In the year <math>2001</math>, the United States will host the International Math Olympiad. Let <math>I, M,</math> and <math>O</math> be distinct positive integers such that the product <math>I\cdot M \cdot O=2001</math>. What is the largest possible sum <math>I+M+O</math>?
  
 
<math>\textbf{(A)}\ 23 \qquad\textbf{(B)}\ 55 \qquad\textbf{(C)}\ 99 \qquad\textbf{(D)}\ 111 \qquad\textbf{(E)}\ 671</math>
 
<math>\textbf{(A)}\ 23 \qquad\textbf{(B)}\ 55 \qquad\textbf{(C)}\ 99 \qquad\textbf{(D)}\ 111 \qquad\textbf{(E)}\ 671</math>
Line 291: Line 296:
 
== Problem 21 ==
 
== Problem 21 ==
  
−
If all alligators are ferocious creatures and some ugly crawlers are alligators, which statement(s) must be true?
+
If all alligators are ferocious creatures and some creepy crawlers are alligators, which statement(s) must be true?
  
−
<cmath>\textrm{I. All alligators are uglyy crawlers.}</cmath>
+
<cmath>\textrm{I. All alligators are creepy crawlers.}</cmath>
−
<cmath>\textrm{II. Some ferocious creatures are ugly crawlers.}</cmath>
+
<cmath>\textrm{II. Some ferocious creatures are creepy crawlers.}</cmath>
−
<cmath>\textrm{III. Some alligators are not ugly crawlers.}</cmath>
+
<cmath>\textrm{III. Some alligators are not creepy crawlers.}</cmath>
  
 
<math>\textbf{(A)}\ \text{I only} \qquad\textbf{(B)}\ \text{II only} \qquad\textbf{(C)}\ \text{III only} \qquad\textbf{(D)}\ \text{II and III only} \qquad\textbf{(E)}\ \text{None must be true}</math>
 
<math>\textbf{(A)}\ \text{I only} \qquad\textbf{(B)}\ \text{II only} \qquad\textbf{(C)}\ \text{III only} \qquad\textbf{(D)}\ \text{II and III only} \qquad\textbf{(E)}\ \text{None must be true}</math>
Line 316: Line 321:
  
  
−
-Error fixed(BIGFOOT09) Changes Copyrighted©
 
  
  
Line 338: Line 342:
  
 
== See also ==
 
== See also ==
−
{{AMC10 box|year=2000|before=First<br />AMC 10|after=[[2001 AMC 10 Problems|2001 AMC 10]]}}
+
{{AMC10 box|year=2000|before=This was the first<br />AMC 10|after=[[2001 AMC 10 Problems|2001 AMC 10]]}}
 
* [[AMC 10]]
 
* [[AMC 10]]
 
* [[AMC 10 Problems and Solutions]]
 
* [[AMC 10 Problems and Solutions]]
 
* [[Mathematics competition resources]]
 
* [[Mathematics competition resources]]
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 00:12, 10 November 2024

2000 AMC 10 (Answer Key)
Printable versions: Wiki • AoPS Resources • PDF

Instructions

  1. This is a 25-question, multiple choice test. Each question is followed by answers marked A, B, C, D and E. Only one of these is correct.
  2. You will receive 6 points for each correct answer, 2.5 points for each problem left unanswered if the year is before 2006, 1.5 points for each problem left unanswered if the year is after 2006, and 0 points for each incorrect answer.
  3. No aids are permitted other than scratch paper, graph paper, ruler, compass, protractor and erasers (and calculators that are accepted for use on the SAT if before 2006. No problems on the test will require the use of a calculator).
  4. Figures are not necessarily drawn to scale.
  5. You will have 75 minutes working time to complete the test.
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25



Problem 1

In the year $2001$, the United States will host the International Math Olympiad. Let $I, M,$ and $O$ be distinct positive integers such that the product $I\cdot M \cdot O=2001$. What is the largest possible sum $I+M+O$?

$\textbf{(A)}\ 23 \qquad\textbf{(B)}\ 55 \qquad\textbf{(C)}\ 99 \qquad\textbf{(D)}\ 111 \qquad\textbf{(E)}\ 671$

Solution

Problem 2

$2000({2000}^{2000}) =$

$\textbf{(A)}\ {2000}^{2001} \qquad \textbf{(B)}\ {4000}^{2000} \qquad \textbf{(C)}\ {2000}^{4000} \qquad \textbf{(D)}\ {4,000,000}^{2000} \qquad\textbf{(E)}\ {2000}^{4,000,000}$

Solution

Problem 3

Each day, Jenny ate $20\%$ of the jellybeans that were in her jar at the beginning of that day. At the end of the second day, $32$ remained. How many jellybeans were in the jar originally?

$\textbf{(A)}\ 40 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 55 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$

Solution

Problem 4

Chandra pays an on-line service provider a fixed monthly fee plus an hourly charge for connect time. Her December bill was $$12.48$, but in January her bill was $$17.54$ because she used twice as much connect time as in December. What is the fixed monthly fee?

$\textbf{(A) } $2.53 \qquad\textbf{(B) } $5.06 \qquad\textbf{(C) } $6.24 \qquad\textbf{(D) } $7.42 \qquad\textbf{(E) } $8.77$

Solution

Problem 5

Points $M$ and $N$ are the midpoints of sides $PA$ and $PB$ of $\triangle PAB$. As $P$ moves along a line that is parallel to side $AB$, how many of the four quantities listed below change?

(a) the length of the segment $MN$

(b) the perimeter of $\triangle PAB$

(c) the area of $\triangle PAB$

(d) the area of trapezoid $ABNM$

[asy] draw((2,0)--(8,0)--(6,4)--cycle); draw((4,2)--(7,2)); draw((1,4)--(9,4),Arrows); label("$A$",(2,0),SW); label("$B$",(8,0),SE); label("$M$",(4,2),W); label("$N$",(7,2),E); label("$P$",(6,4),N); [/asy]

$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4$

Solution

Problem 6

The Fibonacci sequence $1, 1, 2, 3, 5, 8, 13, 21, \ldots$ starts with two $1$s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci sequence?

$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 9$

Solution

Problem 7

In rectangle $ABCD$, $AD=1$, $P$ is on $\overline{AB}$, and $\overline{DB}$ and $\overline{DP}$ trisect $\angle ADC$. What is the perimeter of $\triangle BDP$?

[asy] draw((0,2)--(3.4,2)--(3.4,0)--(0,0)--cycle); draw((0,0)--(1.3,2)); draw((0,0)--(3.4,2)); dot((0,0)); dot((0,2)); dot((3.4,2)); dot((3.4,0)); dot((1.3,2)); label("$A$",(0,2),NW); label("$B$",(3.4,2),NE); label("$C$",(3.4,0),SE); label("$D$",(0,0),SW); label("$P$",(1.3,2),N); [/asy]

$\textbf{(A)}\ 3+\frac{\sqrt{3}}{3} \qquad\textbf{(B)}\ 2+\frac{4\sqrt{3}}{3} \qquad\textbf{(C)}\ 2+2\sqrt{2} \qquad\textbf{(D)}\ \frac{3+3\sqrt{5}}{2} \qquad\textbf{(E)}\ 2+\frac{5\sqrt{3}}{3}$

Solution

Problem 8

At Olympic High School, $\frac{2}{5}$ of the freshmen and $\frac{4}{5}$ of the sophomores took the AMC 10. Given that the number of freshmen and sophomore contestants was the same, which of the following must be true?

$\textbf{(A) }$ There are five times as many sophomores as freshmen.

$\textbf{(B) }$ There are twice as many sophomores as freshmen.

$\textbf{(C) }$ There are as many freshmen as sophomores.

$\textbf{(D) }$ There are twice as many freshmen as sophomores.

$\textbf{(E) }$ There are five times as many freshmen as sophomores.

Solution

Problem 9

If $|x-2|=p$, where $x<2$, then $x-p=$

$\textbf{(A)}\ -2 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 2-2p \qquad\textbf{(D)}\ 2p-2 \qquad\textbf{(E)}\ |2p-2|$

Solution

Problem 10

The sides of a triangle with positive area have lengths $4$, $6$, and $x$. The sides of a second triangle with positive area have lengths $4$, $6$, and $y$. What is the smallest positive number that is not a possible value of $|x-y|$?

$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 10$

Solution

Problem 11

Two different prime numbers between $4$ and $18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?

$\textbf{(A)}\ 22 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 119 \qquad\textbf{(D)}\ 180 \qquad\textbf{(E)}\ 231$

Solution

Problem 12

Figures $0$, $1$, $2$, and $3$ consist of $1$, $5$, $13$, and $25$ nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?

[asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S); [/asy]


$\textbf{(A)}\ 10401 \qquad\textbf{(B)}\ 19801 \qquad\textbf{(C)}\ 20201 \qquad\textbf{(D)}\ 39801 \qquad\textbf{(E)}\ 40801$

Solution

Problem 13

There are 5 yellow pegs, 4 red pegs, 3 green pegs, 2 blue pegs, and 1 orange peg to be placed on a triangular peg board. In how many ways can the pegs be placed so that no (horizontal) row or (vertical) column contains two pegs of the same color?

[asy] unitsize(20); dot((0,0)); dot((1,0)); dot((2,0)); dot((3,0)); dot((4,0)); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((0,3)); dot((1,3)); dot((0,4)); [/asy]


$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 5!\cdot 4!\cdot 3!\cdot 2!\cdot 1! \qquad\textbf{(D)}\ \frac{15!}{5!\cdot 4!\cdot 3!\cdot 2!\cdot 1!} \qquad\textbf{(E)}\ 15!$

Solution

Problem 14

Mrs. Walter gave an exam in a mathematics class of five students. She entered the scores in random order into a spreadsheet, which recalculated the class average after each score was entered. Mrs. Walter noticed that after each score was entered, the average was always an integer. The scores (listed in ascending order) were $71$, $76$, $80$, $82$, and $91$. What was the last score Mrs. Walter entered?

$\textbf{(A)}\ 71 \qquad\textbf{(B)}\ 76 \qquad\textbf{(C)}\ 80 \qquad\textbf{(D)}\ 82 \qquad\textbf{(E)}\ 91$

Solution

Problem 15

Two non-zero real numbers, $a$ and $b$, satisfy $ab=a-b$. Find a possible value of $\frac{a}{b}+\frac{b}{a}-ab$.

$\textbf{(A)}\ -2 \qquad\textbf{(B)}\ -\frac{1}{2} \qquad\textbf{(C)}\ \frac{1}{3} \qquad\textbf{(D)}\ \frac{1}{2} \qquad\textbf{(E)}\ 2$

Solution

Problem 16

The diagram shows $28$ lattice points, each one unit from its nearest neighbors. Segment $AB$ meets segment $CD$ at $E$. Find the length of segment $AE$.

[asy] path seg1, seg2; seg1=(6,0)--(0,3); seg2=(2,0)--(4,2); dot((0,0)); dot((1,0)); fill(circle((2,0),0.1),black); dot((3,0)); dot((4,0)); dot((5,0)); fill(circle((6,0),0.1),black); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((4,1)); dot((5,1)); dot((6,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); fill(circle((4,2),0.1),black); dot((5,2)); dot((6,2)); fill(circle((0,3),0.1),black); dot((1,3)); dot((2,3)); dot((3,3)); dot((4,3)); dot((5,3)); dot((6,3)); draw(seg1); draw(seg2); pair [] x=intersectionpoints(seg1,seg2); fill(circle(x[0],0.1),black); label("$A$",(0,3),NW); label("$B$",(6,0),SE); label("$C$",(4,2),NE); label("$D$",(2,0),S); label("$E$",x[0],N); [/asy]

$\textbf{(A)}\ \frac{4\sqrt{5}}{3} \qquad\textbf{(B)}\ \frac{5\sqrt{5}}{3} \qquad\textbf{(C)}\ \frac{12\sqrt{5}}{7} \qquad\textbf{(D)}\ 2\sqrt{5} \qquad\textbf{(E)}\ \frac{5\sqrt{65}}{9}$

Solution

Problem 17

Boris has an incredible coin changing machine. When he puts in a quarter, it returns five nickels; when he puts in a nickel, it returns five pennies; and when he puts in a penny, it returns five quarters. Boris starts with just one penny. Which of the following amounts could Boris have after using the machine repeatedly?

$\textbf{(A) } $3.63 \qquad \textbf{(B) } $5.13 \qquad \textbf{(C) } $6.30 \qquad \textbf{(D) } $7.45 \qquad \textbf{(E) } $9.07$

Solution

Problem 18

Charlyn walks completely around the boundary of a square whose sides are each $5$ km long. From any point on her path she can see exactly $1$ km horizontally in all directions. What is the area of the region consisting of all points Charlyn can see during her walk, expressed in square kilometers and rounded to the nearest whole number?

$\textbf{(A) } 24 \qquad\textbf{(B)}\ 27 \qquad\textbf{(C)}\ 39 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ 42$

Solution

Problem 19

Through a point on the hypotenuse of a right triangle, lines are drawn parallel to the legs of the triangle so that the triangle is divided into a square and two smaller right triangles. The area of one of the two small right triangles is $m$ times the area of the square. The ratio of the area of the other small right triangle to the area of the square is

$\textbf{(A)}\ \frac{1}{2m+1} \qquad\textbf{(B)}\ m \qquad\textbf{(C)}\ 1-m \qquad\textbf{(D)}\ \frac{1}{4m} \qquad\textbf{(E)}\ \frac{1}{8m^2}$

Solution

Problem 20

Let $A$, $M$, and $C$ be nonnegative integers such that $A+M+C=10$. What is the maximum value of $A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A$?

$\textbf{(A)}\ 49 \qquad\textbf{(B)}\ 59 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 79 \qquad\textbf{(E)}\ 89$

Solution

Problem 21

If all alligators are ferocious creatures and some creepy crawlers are alligators, which statement(s) must be true?

\[\textrm{I. All alligators are creepy crawlers.}\] \[\textrm{II. Some ferocious creatures are creepy crawlers.}\] \[\textrm{III. Some alligators are not creepy crawlers.}\]

$\textbf{(A)}\ \text{I only} \qquad\textbf{(B)}\ \text{II only} \qquad\textbf{(C)}\ \text{III only} \qquad\textbf{(D)}\ \text{II and III only} \qquad\textbf{(E)}\ \text{None must be true}$

Solution

Problem 22

One morning each member of Angela's family drank an 8-ounce mixture of coffee with milk. The amounts of coffee and milk varied from cup to cup, but were never zero. Angela drank a quarter of the total amount of milk and a sixth of the total amount of coffee. How many people are in the family?

$\textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 7$

Solution

Problem 23

When the mean, median, and mode of the list \[10,2,5,2,4,2,x\] are arranged in increasing order, they form a non-constant arithmetic progression. What is the sum of all possible real values of $x$?

$\textbf{(A)}\ 3 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 17 \qquad\textbf{(E)}\ 20$



Solution

Problem 24

Let $f$ be a function for which $f\left(\frac{x}{3}\right)=x^2+x+1$. Find the sum of all values of $z$ for which $f(3z)=7$.

$\textbf{(A)}\ -\frac{1}{3} \qquad\textbf{(B)}\ -\frac{1}{9} \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ \frac{5}{9} \qquad\textbf{(E)}\ \frac{5}{3}$

Solution

Problem 25

In year $N$, the $300^\text{th}$ day of the year is a Tuesday. In year $N+1$, the $200^\text{th}$ day is also a Tuesday. On what day of the week did the $100^\text{th}$ day of year $N-1$ occur?

$\textbf{(A)}\ \text{Thursday} \qquad\textbf{(B)}\ \text{Friday} \qquad\textbf{(C)}\ \text{Saturday} \qquad\textbf{(D)}\ \text{Sunday} \qquad\textbf{(E)}\ \text{Monday}$

Solution

See also

2000 AMC 10 (Problems • Answer Key • Resources)
Preceded by
This was the first
AMC 10 		Followed by
2001 AMC 10
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2000_AMC_10_Problems&oldid=232960"