Difference between revisions of "2000 AMC 10 Problems"
5849206328x (talk | contribs) (→Problem 8) |
(→Problem 9) |
||
(68 intermediate revisions by 30 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{AMC10 Problems|year=2000|ab=}} | ||
==Problem 1== | ==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>? | 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>? | ||
− | <math>\ | + | <math>\textbf{(A)}\ 23 \qquad\textbf{(B)}\ 55 \qquad\textbf{(C)}\ 99 \qquad\textbf{(D)}\ 111 \qquad\textbf{(E)}\ 671</math> |
[[2000 AMC 10 Problems/Problem 1|Solution]] | [[2000 AMC 10 Problems/Problem 1|Solution]] | ||
Line 11: | Line 12: | ||
<math>2000({2000}^{2000}) =</math> | <math>2000({2000}^{2000}) =</math> | ||
− | <math>\ | + | <math>\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}</math> |
[[2000 AMC 10 Problems/Problem 2|Solution]] | [[2000 AMC 10 Problems/Problem 2|Solution]] | ||
Line 19: | Line 20: | ||
Each day, Jenny ate <math>20\%</math> of the jellybeans that were in her jar at the beginning of that day. At the end of the second day, <math>32</math> remained. How many jellybeans were in the jar originally? | Each day, Jenny ate <math>20\%</math> of the jellybeans that were in her jar at the beginning of that day. At the end of the second day, <math>32</math> remained. How many jellybeans were in the jar originally? | ||
− | <math>\ | + | <math>\textbf{(A)}\ 40 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 55 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75</math> |
[[2000 AMC 10 Problems/Problem 3|Solution]] | [[2000 AMC 10 Problems/Problem 3|Solution]] | ||
Line 25: | Line 26: | ||
== Problem 4 == | == Problem 4 == | ||
− | Chandra pays an on-line service provider a fixed monthly fee plus an hourly charge for connect time. Her December bill was <math>\ | + | Chandra pays an on-line service provider a fixed monthly fee plus an hourly charge for connect time. Her December bill was <math>\$12.48</math>, but in January her bill was <math>\$17.54</math> because she used twice as much connect time as in December. What is the fixed monthly fee? |
− | <math>\ | + | <math>\textbf{(A) } \$2.53 \qquad\textbf{(B) } \$5.06 \qquad\textbf{(C) } \$6.24 \qquad\textbf{(D) } \$7.42 \qquad\textbf{(E) } \$8.77</math> |
[[2000 AMC 10 Problems/Problem 4|Solution]] | [[2000 AMC 10 Problems/Problem 4|Solution]] | ||
Line 43: | Line 44: | ||
(d) the area of trapezoid <math>ABNM</math> | (d) the area of trapezoid <math>ABNM</math> | ||
− | <math>\ | + | <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> | ||
+ | |||
+ | <math>\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4</math> | ||
[[2000 AMC 10 Problems/Problem 5|Solution]] | [[2000 AMC 10 Problems/Problem 5|Solution]] | ||
Line 49: | Line 61: | ||
== Problem 6 == | == Problem 6 == | ||
− | The Fibonacci sequence <math>1, 1, 2, 3, 5, 8, 13, 21, \ldots</math> starts with two <math>1</math>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? | + | The Fibonacci sequence <math>1, 1, 2, 3, 5, 8, 13, 21, \ldots</math> starts with two <math>1</math>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? |
− | <math>\ | + | <math>\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 9</math> |
[[2000 AMC 10 Problems/Problem 6|Solution]] | [[2000 AMC 10 Problems/Problem 6|Solution]] | ||
Line 59: | Line 71: | ||
In rectangle <math>ABCD</math>, <math>AD=1</math>, <math>P</math> is on <math>\overline{AB}</math>, and <math>\overline{DB}</math> and <math>\overline{DP}</math> trisect <math>\angle ADC</math>. What is the perimeter of <math>\triangle BDP</math>? | In rectangle <math>ABCD</math>, <math>AD=1</math>, <math>P</math> is on <math>\overline{AB}</math>, and <math>\overline{DB}</math> and <math>\overline{DP}</math> trisect <math>\angle ADC</math>. What is the perimeter of <math>\triangle BDP</math>? | ||
− | <math>\ | + | <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> | ||
+ | |||
+ | <math>\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}</math> | ||
[[2000 AMC 10 Problems/Problem 7|Solution]] | [[2000 AMC 10 Problems/Problem 7|Solution]] | ||
Line 65: | Line 93: | ||
== Problem 8 == | == Problem 8 == | ||
− | At Olympic High School, <math>\frac{2}{5}</math> of the freshmen and <math>\frac{4}{5}</math> of the sophomores took the AMC | + | At Olympic High School, <math>\frac{2}{5}</math> of the freshmen and <math>\frac{4}{5}</math> 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? |
− | <math>\ | + | <math>\textbf{(A) }</math> There are five times as many sophomores as freshmen. |
− | <math>\ | + | <math>\textbf{(B) }</math> There are twice as many sophomores as freshmen. |
− | <math>\ | + | <math>\textbf{(C) }</math> There are as many freshmen as sophomores. |
− | <math>\ | + | <math>\textbf{(D) }</math> There are twice as many freshmen as sophomores. |
− | <math>\ | + | <math>\textbf{(E) }</math> There are five times as many freshmen as sophomores. |
[[2000 AMC 10 Problems/Problem 8|Solution]] | [[2000 AMC 10 Problems/Problem 8|Solution]] | ||
== Problem 9 == | == Problem 9 == | ||
+ | |||
+ | If <math>|x-2|=p</math>, where <math>x<2</math>, then <math>x-p=</math> | ||
+ | |||
+ | <math>\textbf{(A)}\ -2 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 2-2p \qquad\textbf{(D)}\ 2p-2 \qquad\textbf{(E)}\ |2p-2|</math> | ||
[[2000 AMC 10 Problems/Problem 9|Solution]] | [[2000 AMC 10 Problems/Problem 9|Solution]] | ||
== Problem 10 == | == Problem 10 == | ||
+ | |||
+ | The sides of a triangle with positive area have lengths <math>4</math>, <math>6</math>, and <math>x</math>. The sides of a second triangle with positive area have lengths <math>4</math>, <math>6</math>, and <math>y</math>. What is the smallest positive number that is '''not''' a possible value of <math>|x-y|</math>? | ||
+ | |||
+ | <math>\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 10</math> | ||
[[2000 AMC 10 Problems/Problem 10|Solution]] | [[2000 AMC 10 Problems/Problem 10|Solution]] | ||
== Problem 11 == | == Problem 11 == | ||
+ | |||
+ | Two different prime numbers between <math>4</math> and <math>18</math> are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained? | ||
+ | |||
+ | <math>\textbf{(A)}\ 22 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 119 \qquad\textbf{(D)}\ 180 \qquad\textbf{(E)}\ 231</math> | ||
[[2000 AMC 10 Problems/Problem 11|Solution]] | [[2000 AMC 10 Problems/Problem 11|Solution]] | ||
== Problem 12 == | == Problem 12 == | ||
+ | |||
+ | Figures <math>0</math>, <math>1</math>, <math>2</math>, and <math>3</math> consist of <math>1</math>, <math>5</math>, <math>13</math>, and <math>25</math> 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> | ||
+ | |||
+ | |||
+ | <math>\textbf{(A)}\ 10401 \qquad\textbf{(B)}\ 19801 \qquad\textbf{(C)}\ 20201 \qquad\textbf{(D)}\ 39801 \qquad\textbf{(E)}\ 40801</math> | ||
[[2000 AMC 10 Problems/Problem 12|Solution]] | [[2000 AMC 10 Problems/Problem 12|Solution]] | ||
== Problem 13 == | == 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> | ||
+ | |||
+ | |||
+ | <math>\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!</math> | ||
[[2000 AMC 10 Problems/Problem 13|Solution]] | [[2000 AMC 10 Problems/Problem 13|Solution]] | ||
== Problem 14 == | == 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 <math>71</math>, <math>76</math>, <math>80</math>, <math>82</math>, and <math>91</math>. What was the last score Mrs. Walter entered? | ||
+ | |||
+ | <math>\textbf{(A)}\ 71 \qquad\textbf{(B)}\ 76 \qquad\textbf{(C)}\ 80 \qquad\textbf{(D)}\ 82 \qquad\textbf{(E)}\ 91</math> | ||
[[2000 AMC 10 Problems/Problem 14|Solution]] | [[2000 AMC 10 Problems/Problem 14|Solution]] | ||
== Problem 15 == | == Problem 15 == | ||
+ | |||
+ | Two non-zero real numbers, <math>a</math> and <math>b</math>, satisfy <math>ab=a-b</math>. Find a possible value of <math>\frac{a}{b}+\frac{b}{a}-ab</math>. | ||
+ | |||
+ | <math>\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</math> | ||
[[2000 AMC 10 Problems/Problem 15|Solution]] | [[2000 AMC 10 Problems/Problem 15|Solution]] | ||
== Problem 16 == | == Problem 16 == | ||
+ | |||
+ | The diagram shows <math>28</math> lattice points, each one unit from its nearest neighbors. Segment <math>AB</math> meets segment <math>CD</math> at <math>E</math>. Find the length of segment <math>AE</math>. | ||
+ | |||
+ | <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> | ||
+ | |||
+ | <math>\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}</math> | ||
[[2000 AMC 10 Problems/Problem 16|Solution]] | [[2000 AMC 10 Problems/Problem 16|Solution]] | ||
== Problem 17 == | == 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? | ||
+ | |||
+ | <math>\textbf{(A) } \$3.63 \qquad \textbf{(B) } \$5.13 \qquad \textbf{(C) } \$6.30 \qquad \textbf{(D) } \$7.45 \qquad \textbf{(E) } \$9.07</math> | ||
[[2000 AMC 10 Problems/Problem 17|Solution]] | [[2000 AMC 10 Problems/Problem 17|Solution]] | ||
== Problem 18 == | == Problem 18 == | ||
+ | |||
+ | Charlyn walks completely around the boundary of a square whose sides are each <math>5</math> km long. From any point on her path she can see exactly <math>1</math> 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? | ||
+ | |||
+ | <math>\textbf{(A) } 24 \qquad\textbf{(B)}\ 27 \qquad\textbf{(C)}\ 39 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ 42</math> | ||
[[2000 AMC 10 Problems/Problem 18|Solution]] | [[2000 AMC 10 Problems/Problem 18|Solution]] | ||
== Problem 19 == | == 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 <math>m</math> times the area of the square. The ratio of the area of the other small right triangle to the area of the square is | ||
+ | |||
+ | <math>\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}</math> | ||
[[2000 AMC 10 Problems/Problem 19|Solution]] | [[2000 AMC 10 Problems/Problem 19|Solution]] | ||
== Problem 20 == | == Problem 20 == | ||
+ | |||
+ | Let <math>A</math>, <math>M</math>, and <math>C</math> be nonnegative integers such that <math>A+M+C=10</math>. What is the maximum value of <math>A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A</math>? | ||
+ | |||
+ | <math>\textbf{(A)}\ 49 \qquad\textbf{(B)}\ 59 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 79 \qquad\textbf{(E)}\ 89</math> | ||
[[2000 AMC 10 Problems/Problem 20|Solution]] | [[2000 AMC 10 Problems/Problem 20|Solution]] | ||
== Problem 21 == | == Problem 21 == | ||
+ | |||
+ | If all alligators are ferocious creatures and some ugly crawlers are alligators, which statement(s) must be true? | ||
+ | |||
+ | <cmath>\textrm{I. All alligators are ugly crawlers.}</cmath> | ||
+ | <cmath>\textrm{II. Some ferocious creatures are ugly crawlers.}</cmath> | ||
+ | <cmath>\textrm{III. Some alligators are not ugly 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> | ||
[[2000 AMC 10 Problems/Problem 21|Solution]] | [[2000 AMC 10 Problems/Problem 21|Solution]] | ||
== Problem 22 == | == 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? | ||
+ | |||
+ | <math>\textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 7</math> | ||
[[2000 AMC 10 Problems/Problem 22|Solution]] | [[2000 AMC 10 Problems/Problem 22|Solution]] | ||
== Problem 23 == | == Problem 23 == | ||
+ | |||
+ | When the mean, median, and mode of the list <cmath>10,2,5,2,4,2,x</cmath> are arranged in increasing order, they form a non-constant arithmetic progression. What is the sum of all possible real values of <math>x</math>? | ||
+ | |||
+ | <math>\textbf{(A)}\ 3 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 17 \qquad\textbf{(E)}\ 20</math> | ||
+ | |||
+ | |||
+ | -Error fixed(BIGFOOT09) Changes Copyrighted© | ||
+ | |||
[[2000 AMC 10 Problems/Problem 23|Solution]] | [[2000 AMC 10 Problems/Problem 23|Solution]] | ||
== Problem 24 == | == Problem 24 == | ||
+ | |||
+ | Let <math>f</math> be a function for which <math>f\left(\frac{x}{3}\right)=x^2+x+1</math>. Find the sum of all values of <math>z</math> for which <math>f(3z)=7</math>. | ||
+ | |||
+ | <math>\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}</math> | ||
[[2000 AMC 10 Problems/Problem 24|Solution]] | [[2000 AMC 10 Problems/Problem 24|Solution]] | ||
== Problem 25 == | == Problem 25 == | ||
+ | |||
+ | In year <math>N</math>, the <math>300^\text{th}</math> day of the year is a Tuesday. In year <math>N+1</math>, the <math>200^\text{th}</math> day is also a Tuesday. On what day of the week did the <math>100^\text{th}</math> day of year <math>N-1</math> occur? | ||
+ | |||
+ | <math>\textbf{(A)}\ \text{Thursday} \qquad\textbf{(B)}\ \text{Friday} \qquad\textbf{(C)}\ \text{Saturday} \qquad\textbf{(D)}\ \text{Sunday} \qquad\textbf{(E)}\ \text{Monday}</math> | ||
[[2000 AMC 10 Problems/Problem 25|Solution]] | [[2000 AMC 10 Problems/Problem 25|Solution]] | ||
== See also == | == See also == | ||
+ | {{AMC10 box|year=2000|before=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}} |
Latest revision as of 21:57, 2 May 2024
2000 AMC 10 (Answer Key) Printable versions: • AoPS Resources • PDF | ||
Instructions
| ||
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 |
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 See also
Problem 1
In the year 2001, the United States will host the International Mathematical Olympiad. Let ,
, and
be distinct positive integers such that the product
. What is the largest possible value of the sum
?
Problem 2
Problem 3
Each day, Jenny ate of the jellybeans that were in her jar at the beginning of that day. At the end of the second day,
remained. How many jellybeans were in the jar originally?
Problem 4
Chandra pays an on-line service provider a fixed monthly fee plus an hourly charge for connect time. Her December bill was , but in January her bill was
because she used twice as much connect time as in December. What is the fixed monthly fee?
Problem 5
Points and
are the midpoints of sides
and
of
. As
moves along a line that is parallel to side
, how many of the four quantities listed below change?
(a) the length of the segment
(b) the perimeter of
(c) the area of
(d) the area of trapezoid
Problem 6
The Fibonacci sequence starts with two
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?
Problem 7
In rectangle ,
,
is on
, and
and
trisect
. What is the perimeter of
?
Problem 8
At Olympic High School, of the freshmen and
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?
There are five times as many sophomores as freshmen.
There are twice as many sophomores as freshmen.
There are as many freshmen as sophomores.
There are twice as many freshmen as sophomores.
There are five times as many freshmen as sophomores.
Problem 9
If , where
, then
Problem 10
The sides of a triangle with positive area have lengths ,
, and
. The sides of a second triangle with positive area have lengths
,
, and
. What is the smallest positive number that is not a possible value of
?
Problem 11
Two different prime numbers between and
are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
Problem 12
Figures ,
,
, and
consist of
,
,
, and
nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?
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?
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 ,
,
,
, and
. What was the last score Mrs. Walter entered?
Problem 15
Two non-zero real numbers, and
, satisfy
. Find a possible value of
.
Problem 16
The diagram shows lattice points, each one unit from its nearest neighbors. Segment
meets segment
at
. Find the length of segment
.
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?
Problem 18
Charlyn walks completely around the boundary of a square whose sides are each km long. From any point on her path she can see exactly
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?
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 times the area of the square. The ratio of the area of the other small right triangle to the area of the square is
Problem 20
Let ,
, and
be nonnegative integers such that
. What is the maximum value of
?
Problem 21
If all alligators are ferocious creatures and some ugly crawlers are alligators, which statement(s) must be true?
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?
Problem 23
When the mean, median, and mode of the list are arranged in increasing order, they form a non-constant arithmetic progression. What is the sum of all possible real values of
?
-Error fixed(BIGFOOT09) Changes Copyrighted©
Problem 24
Let be a function for which
. Find the sum of all values of
for which
.
Problem 25
In year , the
day of the year is a Tuesday. In year
, the
day is also a Tuesday. On what day of the week did the
day of year
occur?
See also
2000 AMC 10 (Problems • Answer Key • Resources) | ||
Preceded by 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.