Difference between revisions of "2021 MECC Mock AMC 10"
(Created page with "==Problem 1== Compute <math>|2^{2}+2^{1}+2^{0}-3^{1}-3^{2}-3^{3}|</math> <math>\textbf{(A)} ~31 \qquad\textbf{(B)} ~32 \qquad\textbf{(C)} ~33 \qquad\textbf{(D)} ~34 \qquad\te...") |
|||
Line 1: | Line 1: | ||
− | ==Problem 1== Compute <math>|2^{2}+2^{1}+2^{0}-3^{1}-3^{2}-3^{3}|</math> | + | ==Problem 1== |
+ | Compute <math>|2^{2}+2^{1}+2^{0}-3^{1}-3^{2}-3^{3}|</math> | ||
<math>\textbf{(A)} ~31 \qquad\textbf{(B)} ~32 \qquad\textbf{(C)} ~33 \qquad\textbf{(D)} ~34 \qquad\textbf{(E)} ~35 </math> | <math>\textbf{(A)} ~31 \qquad\textbf{(B)} ~32 \qquad\textbf{(C)} ~33 \qquad\textbf{(D)} ~34 \qquad\textbf{(E)} ~35 </math> | ||
+ | |||
+ | [[2021 April MIMC 10 Problems/Problem 1|Solution]] | ||
+ | |||
+ | ==Problem 2== | ||
+ | Define a binary operation <math>a\%b=a^{2}+4ab+4b^{2}</math>. Find the number of possible ordered pair of positive integers <math>(a,b)</math> such that <math>a\%b=25</math>. | ||
+ | |||
+ | <math>\textbf{(A)} ~0 \qquad\textbf{(B)} ~1 \qquad\textbf{(C)} ~2 \qquad\textbf{(D)} ~3 \qquad\textbf{(E)} ~4 </math> | ||
+ | |||
+ | [[2021 April MIMC 10 Problems/Problem 2|Solution]] | ||
+ | |||
+ | ==Problem 3== | ||
+ | <math>\sqrt{8+4\sqrt{3}}</math> can be expressed as <math>\sqrt{a}+\sqrt{b}</math>. Find <math>a+b</math>. | ||
+ | |||
+ | <math>\textbf{(A)} ~6 \qquad\textbf{(B)} ~8 \qquad\textbf{(C)} ~10 \qquad\textbf{(D)} ~12 \qquad\textbf{(E)} ~14 </math> | ||
+ | |||
+ | [[2021 April MIMC 10 Problems/Problem 3|Solution]] | ||
+ | |||
+ | ==Problem 4== | ||
+ | Compute the number of ways to arrange 2 distinguishable apples and five indistinguishable books. | ||
+ | |||
+ | <math>\textbf{(A)} ~21 \qquad\textbf{(B)} ~42 \qquad\textbf{(C)} ~63 \qquad\textbf{(D)} ~84 \qquad\textbf{(E)} ~126 </math> | ||
+ | |||
+ | [[2021 April MIMC 10 Problems/Problem 4|Solution]] | ||
+ | |||
+ | ==Problem 5== | ||
+ | Galieo, Neton, Timiel, Fidgety and Jay are participants of a game in soccer. Their coach, Mr.Tom, will allocate them into two INDISTINGUISHABLE groups for practice purpose(People in the teams are interchangable). Given that the coach will not put Galieo and Timiel into the same team because they just had a fight. Find the number of ways the coach can put them into two such groups. | ||
+ | |||
+ | <math>\textbf{(A)} ~24 \qquad\textbf{(B)} ~36 \qquad\textbf{(C)} ~48 \qquad\textbf{(D)} ~72 \qquad\textbf{(E)} ~144 </math> | ||
+ | |||
+ | [[2021 April MIMC 10 Problems/Problem 5|Solution]] | ||
+ | |||
+ | ==Problem 6== | ||
+ | Let <math>a_n</math> be a sequence of positive integers with <math>a_0=1</math> and <math>a_1=2</math> and <math>a_n=a_{n-1}\cdot a_{n+1}</math> for all integers <math>n</math> such that <math>n\geq 1</math>. Find <math>a_{2021}+a_{2023}+a_{2025}</math>. |
Revision as of 22:41, 20 April 2021
Problem 1
Compute
Problem 2
Define a binary operation . Find the number of possible ordered pair of positive integers such that .
Problem 3
can be expressed as . Find .
Problem 4
Compute the number of ways to arrange 2 distinguishable apples and five indistinguishable books.
Problem 5
Galieo, Neton, Timiel, Fidgety and Jay are participants of a game in soccer. Their coach, Mr.Tom, will allocate them into two INDISTINGUISHABLE groups for practice purpose(People in the teams are interchangable). Given that the coach will not put Galieo and Timiel into the same team because they just had a fight. Find the number of ways the coach can put them into two such groups.
Problem 6
Let be a sequence of positive integers with and and for all integers such that . Find .