Difference between revisions of "2019 AMC 10C Problems"
(Added a page on my mock amc 10) |
(→Problem 25) |
||
(17 intermediate revisions by 2 users not shown) | |||
Line 3: | Line 3: | ||
Given that <math>a+m=2017</math>, <math>m+c=2018</math>, and <math>a+c=2019</math>, find the value of <math>a+m+c+10</math>. | Given that <math>a+m=2017</math>, <math>m+c=2018</math>, and <math>a+c=2019</math>, find the value of <math>a+m+c+10</math>. | ||
+ | |||
<math>\mathrm{(A) \ } 3027\qquad \mathrm{(B) \ } 3037\qquad \mathrm{(C) \ } 4037\qquad \mathrm{(D) \ } 6054\qquad \mathrm{(E) \ } 6064</math> | <math>\mathrm{(A) \ } 3027\qquad \mathrm{(B) \ } 3037\qquad \mathrm{(C) \ } 4037\qquad \mathrm{(D) \ } 6054\qquad \mathrm{(E) \ } 6064</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 1|Solution]] | ||
+ | |||
==Problem 2== | ==Problem 2== | ||
Three distinct vertices of a regular pentagon are chosen at random. What is the probability that they form an obtuse triangle? | Three distinct vertices of a regular pentagon are chosen at random. What is the probability that they form an obtuse triangle? | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } \frac{1}{10}\qquad \mathrm{(B) \ } \frac{1}{5}\qquad \mathrm{(C) \ } \frac{1}{2}\qquad \mathrm{(D) \ } \frac{4}{5}\qquad \mathrm{(E) \ } \frac{9}{10}</math> | <math>\mathrm{(A) \ } \frac{1}{10}\qquad \mathrm{(B) \ } \frac{1}{5}\qquad \mathrm{(C) \ } \frac{1}{2}\qquad \mathrm{(D) \ } \frac{4}{5}\qquad \mathrm{(E) \ } \frac{9}{10}</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 2|Solution]] | ||
+ | |||
==Problem 3== | ==Problem 3== | ||
The numbers from 1 to 10 are written on 10 slips of paper, with 1 number on each slip of paper, and put in a bag. Maria will randomly draw 2 slips from the bag without replacement. What is the probability that she will obtain one prime number and one composite number? | The numbers from 1 to 10 are written on 10 slips of paper, with 1 number on each slip of paper, and put in a bag. Maria will randomly draw 2 slips from the bag without replacement. What is the probability that she will obtain one prime number and one composite number? | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } \frac{2}{15}\qquad \mathrm{(B) \ } \frac{2}{5}\qquad \mathrm{(C) \ } \frac{4}{9}\qquad \mathrm{(D) \ } \frac{5}{9}\qquad \mathrm{(E) \ } \frac{8}{9}</math> | <math>\mathrm{(A) \ } \frac{2}{15}\qquad \mathrm{(B) \ } \frac{2}{5}\qquad \mathrm{(C) \ } \frac{4}{9}\qquad \mathrm{(D) \ } \frac{5}{9}\qquad \mathrm{(E) \ } \frac{8}{9}</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 3|Solution]] | ||
+ | |||
==Problem 4== | ==Problem 4== | ||
Line 20: | Line 34: | ||
In the figure below, the part of the 1st square that is not contained in the 2nd square will be shaded, the part of the 3rd square that is not contained in the 4th square will be shaded, the part of the 5th square that is not contained in the 6th square will be shaded, and so on to infinity. What is the ratio of the shaded area to the non-shaded area? | In the figure below, the part of the 1st square that is not contained in the 2nd square will be shaded, the part of the 3rd square that is not contained in the 4th square will be shaded, the part of the 5th square that is not contained in the 6th square will be shaded, and so on to infinity. What is the ratio of the shaded area to the non-shaded area? | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
+ | <math>\mathrm{(A) \ } \frac{1}{3}\qquad \mathrm{(B) \ } \frac{1}{2}\qquad \mathrm{(C) \ } \frac{3}{2}\qquad \mathrm{(D) \ } 2\qquad \mathrm{(E) \ } 3</math> | ||
− | + | [[2019 AMC 10C Problems/Problem 4|Solution]] | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
==Problem 5== | ==Problem 5== | ||
The numeral representation of the product <math>99...9 \times 999...9</math>, where the former number has <math>n</math> 9’s and the latter number has <math>n+1</math> 9’s, where <math>n</math> is some positive integer, has a sum of digits of 630. Find <math>n</math>. | The numeral representation of the product <math>99...9 \times 999...9</math>, where the former number has <math>n</math> 9’s and the latter number has <math>n+1</math> 9’s, where <math>n</math> is some positive integer, has a sum of digits of 630. Find <math>n</math>. | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } 68\qquad \mathrm{(B) \ } 69\qquad \mathrm{(C) \ } 70\qquad \mathrm{(D) \ } 71\qquad \mathrm{(E) \ } 72</math> | <math>\mathrm{(A) \ } 68\qquad \mathrm{(B) \ } 69\qquad \mathrm{(C) \ } 70\qquad \mathrm{(D) \ } 71\qquad \mathrm{(E) \ } 72</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 5|Solution]] | ||
+ | |||
==Problem 6== | ==Problem 6== | ||
− | A function <math>f(x)</math>is defined for all positive integers n>2 as <math>f(n)=f(n-1) \times f(n-2)</math>. Given that <math>f(1)=2</math> and <math>f(2)=3</math>, the value of <math>f(12)</math>can be expressed in the form of <math>2^{p}3^{q}</math>,where <math>p</math> and <math>q</math> are positive integers. Find <math>|p-q|</math>. | + | A function <math>f(x)</math>is defined for all positive integers <math>n>2</math> as <math>f(n)=f(n-1) \times f(n-2)</math>. Given that <math>f(1)=2</math> and <math>f(2)=3</math>, the value of <math>f(12)</math>can be expressed in the form of <math>2^{p}3^{q}</math>,where <math>p</math> and <math>q</math> are positive integers. Find <math>|p-q|</math>. |
+ | |||
+ | |||
<math>\mathrm{(A) \ } 21\qquad \mathrm{(B) \ } 34\qquad \mathrm{(C) \ } 55\qquad \mathrm{(D) \ } 89\qquad \mathrm{(E) \ } 144</math> | <math>\mathrm{(A) \ } 21\qquad \mathrm{(B) \ } 34\qquad \mathrm{(C) \ } 55\qquad \mathrm{(D) \ } 89\qquad \mathrm{(E) \ } 144</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 6|Solution]] | ||
+ | |||
==Problem 7== | ==Problem 7== | ||
Given that <math>n^4 = 22,667,121</math> for a positive integer <math>n</math>, find the sum of the digits of <math>n</math>. | Given that <math>n^4 = 22,667,121</math> for a positive integer <math>n</math>, find the sum of the digits of <math>n</math>. | ||
+ | |||
<math>\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ 18</math> | <math>\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ 18</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 7|Solution]] | ||
+ | |||
==Problem 8== | ==Problem 8== | ||
When rolling 12 standard 6-sided dice, the probability that the sum of the numbers rolled on the 12 dice is 69 can be expressed in <math>\frac{N}{6^{12}}</math>. Find the sum of the digits of <math>N</math>. | When rolling 12 standard 6-sided dice, the probability that the sum of the numbers rolled on the 12 dice is 69 can be expressed in <math>\frac{N}{6^{12}}</math>. Find the sum of the digits of <math>N</math>. | ||
+ | |||
<math>\mathrm{(A) \ } 4\qquad \mathrm{(B) \ } 10\qquad \mathrm{(C) \ } 13\qquad \mathrm{(D) \ } 14\qquad \mathrm{(E) \ } 15</math> | <math>\mathrm{(A) \ } 4\qquad \mathrm{(B) \ } 10\qquad \mathrm{(C) \ } 13\qquad \mathrm{(D) \ } 14\qquad \mathrm{(E) \ } 15</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 8|Solution]] | ||
+ | |||
==Problem 9== | ==Problem 9== | ||
A gear with radius 34.5 rolls around another the circumference of a larger gear with radius 103.5. How many revolutions around the larger gear would the smaller gear have completed by the time it makes 3 complete rotations? | A gear with radius 34.5 rolls around another the circumference of a larger gear with radius 103.5. How many revolutions around the larger gear would the smaller gear have completed by the time it makes 3 complete rotations? | ||
+ | |||
<math>\mathrm{(A) \ } \frac{1}{2}\qquad \mathrm{(B) \ } \frac{2}{3}\qquad \mathrm{(C) \ } \frac{3}{4}\qquad \mathrm{(D) \ } 1\qquad \mathrm{(E) \ } \frac{6}{5}</math> | <math>\mathrm{(A) \ } \frac{1}{2}\qquad \mathrm{(B) \ } \frac{2}{3}\qquad \mathrm{(C) \ } \frac{3}{4}\qquad \mathrm{(D) \ } 1\qquad \mathrm{(E) \ } \frac{6}{5}</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 9|Solution]] | ||
+ | |||
==Problem 10== | ==Problem 10== | ||
Al and Bob play a game of Bottle Flip. Each of them takes turns flipping a water bottle and the first person to not land the bottle is deemed the loser. Al has a <math>\frac{4}{5}</math> chance of landing the bottle every time he flips it, and Bob has a <math>\frac{3}{4}</math> chance of landing the bottle every time he flips it. Given that Al goes first, what is the probability that he wins the game? | Al and Bob play a game of Bottle Flip. Each of them takes turns flipping a water bottle and the first person to not land the bottle is deemed the loser. Al has a <math>\frac{4}{5}</math> chance of landing the bottle every time he flips it, and Bob has a <math>\frac{3}{4}</math> chance of landing the bottle every time he flips it. Given that Al goes first, what is the probability that he wins the game? | ||
+ | |||
<math>\mathrm{(A) \ } \frac{1}{3}\qquad \mathrm{(B) \ } \frac{3}{8}\qquad \mathrm{(C) \ } \frac{1}{2}\qquad \mathrm{(D) \ } \frac{5}{8} \qquad \mathrm{(E) \ } \frac{2}{3}</math> | <math>\mathrm{(A) \ } \frac{1}{3}\qquad \mathrm{(B) \ } \frac{3}{8}\qquad \mathrm{(C) \ } \frac{1}{2}\qquad \mathrm{(D) \ } \frac{5}{8} \qquad \mathrm{(E) \ } \frac{2}{3}</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 10|Solution]] | ||
+ | |||
==Problem 11== | ==Problem 11== | ||
How many base 3 positive integers <math>n</math> with nonzero digits have the property that the sum of the digits of <math>n</math> is 10? | How many base 3 positive integers <math>n</math> with nonzero digits have the property that the sum of the digits of <math>n</math> is 10? | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } 74\qquad \mathrm{(B) \ } 79\qquad \mathrm{(C) \ } 88\qquad \mathrm{(D) \ } 89\qquad \mathrm{(E) \ } 97</math> | <math>\mathrm{(A) \ } 74\qquad \mathrm{(B) \ } 79\qquad \mathrm{(C) \ } 88\qquad \mathrm{(D) \ } 89\qquad \mathrm{(E) \ } 97</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 11|Solution]] | ||
+ | |||
==Problem 12== | ==Problem 12== | ||
In music, a whole octave consists of 12 semitones: C, C#, D, D#, E, F, F#, G, G#, A, A#, and B. Consist a certain four-note chord to be pretty if all four notes are from the same octave and no two notes are either <math>1</math> semitone or <math>11</math> semitones apart. How many four-note chords are not pretty? | In music, a whole octave consists of 12 semitones: C, C#, D, D#, E, F, F#, G, G#, A, A#, and B. Consist a certain four-note chord to be pretty if all four notes are from the same octave and no two notes are either <math>1</math> semitone or <math>11</math> semitones apart. How many four-note chords are not pretty? | ||
+ | |||
<math>\textbf{(A)}\ 117 \qquad\textbf{(B)}\ 369 \qquad\textbf{(C)}\ 390 \qquad\textbf{(D)}\ 425 \qquad\textbf{(E)}\ 440</math> | <math>\textbf{(A)}\ 117 \qquad\textbf{(B)}\ 369 \qquad\textbf{(C)}\ 390 \qquad\textbf{(D)}\ 425 \qquad\textbf{(E)}\ 440</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 12|Solution]] | ||
+ | |||
==Problem 13== | ==Problem 13== | ||
− | How many positive integers <math>N</math> where | + | How many positive integers <math>N</math> where <math>1 \leq N \leq 20</math> cannot be the number of 0s at the end of the decimal representation of <math>x!</math>, where <math>x</math> is a positive integer? |
+ | |||
+ | |||
<math>\mathrm{(A) \ } 2\qquad \mathrm{(B) \ } 3\qquad \mathrm{(C) \ } 4\qquad \mathrm{(D) \ } 5\qquad \mathrm{(E) \ } 6</math> | <math>\mathrm{(A) \ } 2\qquad \mathrm{(B) \ } 3\qquad \mathrm{(C) \ } 4\qquad \mathrm{(D) \ } 5\qquad \mathrm{(E) \ } 6</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 13|Solution]] | ||
+ | |||
==Problem 14== | ==Problem 14== | ||
Let <math>M</math> denote the largest integer power of 16 that allows <math>100^{2019}-16^{M}</math> to be a positive integer and let <math>N</math> denote the smallest integer power of 100 that allows <math>16^{2019}-100^{N}</math> to be a negative integer. In which of the following ranges does <math>M+N</math> lie? | Let <math>M</math> denote the largest integer power of 16 that allows <math>100^{2019}-16^{M}</math> to be a positive integer and let <math>N</math> denote the smallest integer power of 100 that allows <math>16^{2019}-100^{N}</math> to be a negative integer. In which of the following ranges does <math>M+N</math> lie? | ||
+ | |||
<math>\mathrm{(A) \ } [2000,3000]\qquad \mathrm{(B) \ } [3000,4000]\qquad \mathrm{(C) \ } [4000,5000]\qquad \mathrm{(D) \ } [5000,6000]\qquad \mathrm{(E) \ } [6000,7000]</math> | <math>\mathrm{(A) \ } [2000,3000]\qquad \mathrm{(B) \ } [3000,4000]\qquad \mathrm{(C) \ } [4000,5000]\qquad \mathrm{(D) \ } [5000,6000]\qquad \mathrm{(E) \ } [6000,7000]</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 14|Solution]] | ||
+ | |||
==Problem 15== | ==Problem 15== | ||
Line 121: | Line 144: | ||
Let <math>N</math> be <math>2019^{2019^{2019^{2019...}}}</math>. (2019 <math>2019</math>'s) | Let <math>N</math> be <math>2019^{2019^{2019^{2019...}}}</math>. (2019 <math>2019</math>'s) | ||
Find the remainder when <math>N</math> is divided by <math>7</math>. | Find the remainder when <math>N</math> is divided by <math>7</math>. | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } 1\qquad \mathrm{(B) \ } 2\qquad \mathrm{(C) \ } 3\qquad \mathrm{(D) \ } 4\qquad \mathrm{(E) \ } 6</math> | <math>\mathrm{(A) \ } 1\qquad \mathrm{(B) \ } 2\qquad \mathrm{(C) \ } 3\qquad \mathrm{(D) \ } 4\qquad \mathrm{(E) \ } 6</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 15|Solution]] | ||
+ | |||
==Problem 16== | ==Problem 16== | ||
Given that : | Given that : | ||
− | 1.The sum of the roots of <math>ax^3+bx^2+cx+d=0</math>, where <math>a, b, c, </math> and <math>d</math> are integers no more than 1000 and no less than -1000, is <math>7</math>. | + | 1.The sum of the roots of <math>ax^3+bx^2+cx+d=0</math>, where <math>a, b, c, </math> and <math>d</math> are integers no more than 1000 and no less than <math>-1000</math>, is <math>7</math>. |
− | 2.The product of the roots in <math>ax^4+bx^3+cx+abcd=0</math>, where <math>a, b, c,</math> and <math>d</math> are integers no more than 1000 and no less than -1000, is <math>420</math>. | + | 2.The product of the roots in <math>ax^4+bx^3+cx+abcd=0</math>, where <math>a, b, c,</math> and <math>d</math> are integers no more than 1000 and no less than <math>-1000</math>, is <math>420</math>. |
Find the number of ordered pairs <math>(a, b, c, d)</math> that satisfy these conditions. | Find the number of ordered pairs <math>(a, b, c, d)</math> that satisfy these conditions. | ||
+ | |||
<math>\mathrm{(A) \ } 27\qquad \mathrm{(B) \ } 54\qquad \mathrm{(C) \ } 108\qquad \mathrm{(D) \ } 162\qquad \mathrm{(E) \ } 216</math> | <math>\mathrm{(A) \ } 27\qquad \mathrm{(B) \ } 54\qquad \mathrm{(C) \ } 108\qquad \mathrm{(D) \ } 162\qquad \mathrm{(E) \ } 216</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 16|Solution]] | ||
+ | |||
==Problem 17== | ==Problem 17== | ||
Define a subset of the first ten positive integers {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} to be spicy if the sum of the squares of the elements in the subset is divisible by 5. How many spicy subsets are there? | Define a subset of the first ten positive integers {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} to be spicy if the sum of the squares of the elements in the subset is divisible by 5. How many spicy subsets are there? | ||
+ | |||
<math>\mathrm{(A) \ } 35\qquad \mathrm{(B) \ } 70\qquad \mathrm{(C) \ } 140\qquad \mathrm{(D) \ } 210\qquad \mathrm{(E) \ } 280</math> | <math>\mathrm{(A) \ } 35\qquad \mathrm{(B) \ } 70\qquad \mathrm{(C) \ } 140\qquad \mathrm{(D) \ } 210\qquad \mathrm{(E) \ } 280</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 17|Solution]] | ||
+ | |||
==Problem 18== | ==Problem 18== | ||
A tripod has three legs of length 3 feet, 4 feet, and 4 feet. It is set up so that the angle between any two legs is <math>90^{\circ}</math>. The height from the top of the tripod to the ground, in feet, can be expressed in the form <math>\dfrac{a\sqrt{b}}{c}</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are positive integers, <math>a</math> and <math>c</math> are relatively prime, and <math>b</math> is not divisible by the square of a prime. What is <math>a+b+c</math>? | A tripod has three legs of length 3 feet, 4 feet, and 4 feet. It is set up so that the angle between any two legs is <math>90^{\circ}</math>. The height from the top of the tripod to the ground, in feet, can be expressed in the form <math>\dfrac{a\sqrt{b}}{c}</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are positive integers, <math>a</math> and <math>c</math> are relatively prime, and <math>b</math> is not divisible by the square of a prime. What is <math>a+b+c</math>? | ||
+ | |||
<math>\textbf{(A)}\ 53 \qquad\textbf{(B)}\ 57 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 80 \qquad\textbf{(E)}\ 89</math> | <math>\textbf{(A)}\ 53 \qquad\textbf{(B)}\ 57 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 80 \qquad\textbf{(E)}\ 89</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 18|Solution]] | ||
+ | |||
==Problem 19== | ==Problem 19== | ||
Triangle <math>ABC</math> has <math>AB=10</math>, <math>BC=14</math>, and <math>AC=22</math>. The line <math>AN</math>, where <math>N</math> is a point on <math>BC</math>, divides the triangle into two halves with equal perimeters. Let <math>N</math> be the length of <math>AN</math>. Find the greatest integer less or equal to <math>N</math>. | Triangle <math>ABC</math> has <math>AB=10</math>, <math>BC=14</math>, and <math>AC=22</math>. The line <math>AN</math>, where <math>N</math> is a point on <math>BC</math>, divides the triangle into two halves with equal perimeters. Let <math>N</math> be the length of <math>AN</math>. Find the greatest integer less or equal to <math>N</math>. | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } 18\qquad \mathrm{(B) \ } 19\qquad \mathrm{(C) \ } 20\qquad \mathrm{(D) \ } 21\qquad \mathrm{(E) \ } 22</math> | <math>\mathrm{(A) \ } 18\qquad \mathrm{(B) \ } 19\qquad \mathrm{(C) \ } 20\qquad \mathrm{(D) \ } 21\qquad \mathrm{(E) \ } 22</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 19|Solution]] | ||
+ | |||
==Problem 20== | ==Problem 20== | ||
How many five digit positive integers have the property that every two adjacent digits are consecutive? For example, the integer 32345 has this property, while the integer 98623 does not. | How many five digit positive integers have the property that every two adjacent digits are consecutive? For example, the integer 32345 has this property, while the integer 98623 does not. | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } 116\qquad \mathrm{(B) \ } 120\qquad \mathrm{(C) \ } 125\qquad \mathrm{(D) \ } 127\qquad \mathrm{(E) \ } 144</math> | <math>\mathrm{(A) \ } 116\qquad \mathrm{(B) \ } 120\qquad \mathrm{(C) \ } 125\qquad \mathrm{(D) \ } 127\qquad \mathrm{(E) \ } 144</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 20|Solution]] | ||
+ | |||
==Problem 21== | ==Problem 21== | ||
Line 158: | Line 208: | ||
Jack eats candy while abiding to the following rule: | Jack eats candy while abiding to the following rule: | ||
On Day <math>n</math>, he eats exactly <math>n^3</math> pieces of candy if <math>n</math> is odd and exactly <math>n^2</math> pieces of candy if <math>n</math> is even. Let <math>N</math> be the number of candies Jack has eaten after Day 2019. Find the last two digits of <math>N</math>. | On Day <math>n</math>, he eats exactly <math>n^3</math> pieces of candy if <math>n</math> is odd and exactly <math>n^2</math> pieces of candy if <math>n</math> is even. Let <math>N</math> be the number of candies Jack has eaten after Day 2019. Find the last two digits of <math>N</math>. | ||
+ | |||
<math>\textbf{(A)}\ 16 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 40 \qquad\textbf{(D)}\ 80 \qquad\textbf{(E)}\ 90</math> | <math>\textbf{(A)}\ 16 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 40 \qquad\textbf{(D)}\ 80 \qquad\textbf{(E)}\ 90</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 21|Solution]] | ||
+ | |||
==Problem 22== | ==Problem 22== | ||
− | 100 chicks are sitting in a circle. The first chick in the circle says the number 1, then the chick 2 seats away from the first chick says the number 2, then the chick 3 seats away from the chicken that said the number 2 says the number 3, and so on. The process will always go clockwise. Some of the chicks in the circle will say more than one number while others might not even say a number at all. The process stops when the | + | <math>100</math> chicks are sitting in a circle. The first chick in the circle says the number <math>1</math>, then the chick <math>2</math> seats away from the first chick says the number <math>2</math>, then the chick <math>3</math> seats away from the chicken that said the number <math>2</math> says the number <math>3</math>, and so on. The process will always go clockwise. Some of the chicks in the circle will say more than one number while others might not even say a number at all. The process stops when the <math>1001</math>th number is said. How many numbers would the chick that said <math>1001</math> have said by that point (including <math>1001</math>)? |
+ | |||
+ | |||
<math>\mathrm{(A) \ } 20\qquad \mathrm{(B) \ } 21\qquad \mathrm{(C) \ } 30\qquad \mathrm{(D) \ } 31\qquad \mathrm{(E) \ } 41</math> | <math>\mathrm{(A) \ } 20\qquad \mathrm{(B) \ } 21\qquad \mathrm{(C) \ } 30\qquad \mathrm{(D) \ } 31\qquad \mathrm{(E) \ } 41</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 22|Solution]] | ||
+ | |||
==Problem 23== | ==Problem 23== | ||
Bernado has an infinite amount of red, blue, orange, pink, yellow, purple, and black blocks. He puts them in the 2 by 2019 grid such that adjacent blocks are of different colors. What is the hundreds digit of the number of ways he can put the blocks in? | Bernado has an infinite amount of red, blue, orange, pink, yellow, purple, and black blocks. He puts them in the 2 by 2019 grid such that adjacent blocks are of different colors. What is the hundreds digit of the number of ways he can put the blocks in? | ||
+ | |||
<math>\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4</math> | <math>\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 23|Solution]] | ||
+ | |||
==Problem 24== | ==Problem 24== | ||
Let <math>S</math> be the set of points <math>(x,y,z)</math> in the 3-dimensional coordinate plane such that <math>x</math>, <math>y</math>, and <math>z</math> are integers, <math>0 \le x \le 2</math>, <math>0 \le y \le 2</math>, and <math>0 \le z \le 1</math>. How many tetrahedrons of positive volume can be formed by choosing four points in <math>S</math> as vertices of the tetrahedron? | Let <math>S</math> be the set of points <math>(x,y,z)</math> in the 3-dimensional coordinate plane such that <math>x</math>, <math>y</math>, and <math>z</math> are integers, <math>0 \le x \le 2</math>, <math>0 \le y \le 2</math>, and <math>0 \le z \le 1</math>. How many tetrahedrons of positive volume can be formed by choosing four points in <math>S</math> as vertices of the tetrahedron? | ||
+ | |||
+ | |||
<math>\mathrm{(A) \ } 2436\qquad \mathrm{(B) \ } 2472\qquad \mathrm{(C) \ } 2580\qquad \mathrm{(D) \ } 2664\qquad \mathrm{(E) \ } 3060</math> | <math>\mathrm{(A) \ } 2436\qquad \mathrm{(B) \ } 2472\qquad \mathrm{(C) \ } 2580\qquad \mathrm{(D) \ } 2664\qquad \mathrm{(E) \ } 3060</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 24|Solution]] | ||
+ | |||
==Problem 25== | ==Problem 25== | ||
− | Let <math>N</math> be the least positive integer <math>x</math> such that <math>\lfloor \frac{x^{8}}{x-1} \rfloor</math> is a multiple of 10000. Find the sum of the digits of <math>N</math>. (Note: <math>\lfloor x \rfloor</math> denotes the greatest integer less than or equal to <math>x</math>. ) | + | Let <math>N</math> be the least positive integer <math>x</math> such that <math>\left\lfloor \frac{x^{8}}{x-1}\right\rfloor</math> is a multiple of 10000. Find the sum of the digits of <math>N</math>. (Note: <math>\lfloor x \rfloor</math> denotes the greatest integer less than or equal to <math>x</math>. ) |
+ | |||
<math>\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 11 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 24 \qquad\textbf{(E)}\ 36</math> | <math>\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 11 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 24 \qquad\textbf{(E)}\ 36</math> | ||
+ | |||
+ | [[2019 AMC 10C Problems/Problem 25|Solution]] | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | [[AMC 8 2019(Mock) Problems]] | ||
+ | [[AMC 12C 2020 Problems]] | ||
+ | |||
+ | [[AIME 2020(MOCK) Problems]] | ||
+ | |||
+ | [[F = MA 2020 (Mock) Problems]] | ||
+ | |||
+ | [[AMC 10 2021 (Mock) Problems]] |
Latest revision as of 11:14, 29 November 2021
Here are the problems from the 2019 AMC 10C, a mock contest created by the AoPS user fidgetboss_4000.
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
Problem 1
Given that , , and , find the value of .
Problem 2
Three distinct vertices of a regular pentagon are chosen at random. What is the probability that they form an obtuse triangle?
Problem 3
The numbers from 1 to 10 are written on 10 slips of paper, with 1 number on each slip of paper, and put in a bag. Maria will randomly draw 2 slips from the bag without replacement. What is the probability that she will obtain one prime number and one composite number?
Problem 4
In the figure below, the part of the 1st square that is not contained in the 2nd square will be shaded, the part of the 3rd square that is not contained in the 4th square will be shaded, the part of the 5th square that is not contained in the 6th square will be shaded, and so on to infinity. What is the ratio of the shaded area to the non-shaded area?
Problem 5
The numeral representation of the product , where the former number has 9’s and the latter number has 9’s, where is some positive integer, has a sum of digits of 630. Find .
Problem 6
A function is defined for all positive integers as . Given that and , the value of can be expressed in the form of ,where and are positive integers. Find .
Problem 7
Given that for a positive integer , find the sum of the digits of .
Problem 8
When rolling 12 standard 6-sided dice, the probability that the sum of the numbers rolled on the 12 dice is 69 can be expressed in . Find the sum of the digits of .
Problem 9
A gear with radius 34.5 rolls around another the circumference of a larger gear with radius 103.5. How many revolutions around the larger gear would the smaller gear have completed by the time it makes 3 complete rotations?
Problem 10
Al and Bob play a game of Bottle Flip. Each of them takes turns flipping a water bottle and the first person to not land the bottle is deemed the loser. Al has a chance of landing the bottle every time he flips it, and Bob has a chance of landing the bottle every time he flips it. Given that Al goes first, what is the probability that he wins the game?
Problem 11
How many base 3 positive integers with nonzero digits have the property that the sum of the digits of is 10?
Problem 12
In music, a whole octave consists of 12 semitones: C, C#, D, D#, E, F, F#, G, G#, A, A#, and B. Consist a certain four-note chord to be pretty if all four notes are from the same octave and no two notes are either semitone or semitones apart. How many four-note chords are not pretty?
Problem 13
How many positive integers where cannot be the number of 0s at the end of the decimal representation of , where is a positive integer?
Problem 14
Let denote the largest integer power of 16 that allows to be a positive integer and let denote the smallest integer power of 100 that allows to be a negative integer. In which of the following ranges does lie?
Problem 15
Let be . (2019 's) Find the remainder when is divided by .
Problem 16
Given that : 1.The sum of the roots of , where and are integers no more than 1000 and no less than , is . 2.The product of the roots in , where and are integers no more than 1000 and no less than , is . Find the number of ordered pairs that satisfy these conditions.
Problem 17
Define a subset of the first ten positive integers {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} to be spicy if the sum of the squares of the elements in the subset is divisible by 5. How many spicy subsets are there?
Problem 18
A tripod has three legs of length 3 feet, 4 feet, and 4 feet. It is set up so that the angle between any two legs is . The height from the top of the tripod to the ground, in feet, can be expressed in the form , where , , and are positive integers, and are relatively prime, and is not divisible by the square of a prime. What is ?
Problem 19
Triangle has , , and . The line , where is a point on , divides the triangle into two halves with equal perimeters. Let be the length of . Find the greatest integer less or equal to .
Problem 20
How many five digit positive integers have the property that every two adjacent digits are consecutive? For example, the integer 32345 has this property, while the integer 98623 does not.
Problem 21
Jack eats candy while abiding to the following rule: On Day , he eats exactly pieces of candy if is odd and exactly pieces of candy if is even. Let be the number of candies Jack has eaten after Day 2019. Find the last two digits of .
Problem 22
chicks are sitting in a circle. The first chick in the circle says the number , then the chick seats away from the first chick says the number , then the chick seats away from the chicken that said the number says the number , and so on. The process will always go clockwise. Some of the chicks in the circle will say more than one number while others might not even say a number at all. The process stops when the th number is said. How many numbers would the chick that said have said by that point (including )?
Problem 23
Bernado has an infinite amount of red, blue, orange, pink, yellow, purple, and black blocks. He puts them in the 2 by 2019 grid such that adjacent blocks are of different colors. What is the hundreds digit of the number of ways he can put the blocks in?
Problem 24
Let be the set of points in the 3-dimensional coordinate plane such that , , and are integers, , , and . How many tetrahedrons of positive volume can be formed by choosing four points in as vertices of the tetrahedron?
Problem 25
Let be the least positive integer such that is a multiple of 10000. Find the sum of the digits of . (Note: denotes the greatest integer less than or equal to . )