Difference between revisions of "2021 GMC 12"
(→Problem 22) |
(→Problem 22) |
||
Line 100: | Line 100: | ||
<math>\textbf{(A)} ~32+32i \qquad\textbf{(B)} ~32-16\sqrt{2}+64i \qquad\textbf{(C)} ~64+32\sqrt{2}-32i \qquad\textbf{(D)} ~128 \qquad\textbf{(E)} ~256</math> | <math>\textbf{(A)} ~32+32i \qquad\textbf{(B)} ~32-16\sqrt{2}+64i \qquad\textbf{(C)} ~64+32\sqrt{2}-32i \qquad\textbf{(D)} ~128 \qquad\textbf{(E)} ~256</math> | ||
+ | |||
+ | ==Problem 23== | ||
+ | Find the sum of last five digits of <cmath>\sum_{k=1}^{200} \sum_{k=4}^{50} {k-1 \choose 3}</cmath>. | ||
+ | |||
+ | <math>\textbf{(A)} ~3 \qquad\textbf{(B)} ~7 \qquad\textbf{(C)} ~10 \qquad\textbf{(D)} ~11 \qquad\textbf{(E)} ~12</math> | ||
+ | |||
+ | ==Problem 24== | ||
+ | The Terminator is playing a game. He has a deck of card numbered from <math>1-12</math> and he also has two dices. There are three green cards, three blue cards, and six orange cards. Terminator already knew that the three blue cards are <math>9, 6, 4</math> but not necessary in this order, and the three green cards are <math>8,7,5</math> in some order. Terminator will play this game two rounds by choose one card without replacement and roll the two dice. However, at the beginning of the second round, he MUST choose either by reroll one die , re-choose one card WITH replacement or re-choose the card and choose one die to reroll. He wins if in the first rounds his sum of the card number is equal to the sum of the numbers on the dice and in the second round the sum of numbers on the dice is greater than the card number. Given that terminator is a perfectionist and he always optimize his chance of winning. Find the probability that Terminator will replace only his card(He will replace the card and choose one die to reroll IF the probability of replace one card and reroll one die is equal. | ||
+ | |||
+ | <math>\textbf{(A)} ~\frac{1}{27} \qquad\textbf{(B)} ~\frac{1}{9} \qquad\textbf{(C)} ~\frac{5}{27} \qquad\textbf{(D)} ~\frac{8}{27} \qquad\textbf{(E)} ~\frac{1}{3} </math> | ||
+ | |||
+ | ==Problem 25== | ||
+ | All the solution of <math>(z-2-\sqrt{2})^{24}=4096</math> are vertices of a polygon. The smallest solution that when express in polar form, has a <math>y</math> value greater than <math>0</math> but smaller than <math>\frac{\pi}{2}</math> can be expressed as <math>\frac{\sqrt{a}+\sqrt{b}+i\sqrt{c}-i\sqrt{d}+\sqrt{e}+f+i\sqrt{g}-hi}{j}</math> which <math>a,b,c,d,e,f,g,h,j</math> are all not necessarily distinct positive integers, <math>i</math> in this case represents the imagenary number, <math>i</math>, and the fraction is in the most simplified form. Find <math>a+b+c+d+e+f+g+h+j</math>. |
Revision as of 23:02, 26 April 2021
Contents
Problem 1
Compute the number of ways to arrange distinguishable apples and indistinguishable books such that all five books must be adjacent.
Problem 2
In square with side length , point and are on side and respectively, such that is perpendicular to and . Find the area enclosed by the quadrilateral .
Problem 3
Lucas wants to choose a seat to sit in a row of ten seats marked , respectively. Given that Michael595 is an even-preferer and he would sit in any even seat. Find the probability that Lucas would not sit next to Michael595 (because he hates him).
Problem 4
If , find (Note that means logarithmic function that has a base of , and is the natural logarithm.).
Problem 5
Let be a sequence of positive integers with and and for all integers such that . Find .
Problem 6
Compute the remainder when the summation
is divided by .
Problem 7
The answer of this problem can be expressed as which are not necessarily distinct positive integers, and all of are not divisible by any square number. Find .
Problem 8
Let be a term sequence of positive integers such that ,, , , . Find the number of such sequences such that all of .
Problem 9
Find the largest possible such that is divisible by
Problem 10
Let be the sequence of positive integers such that all of the elements in the sequence only includes either a combination of digits of and , or only . For example: and are examples, but not . The first several terms of the sequence is . The th term of the sequence is . What is ?
Problem 11
Given that the two roots of polynomial are and which represents an angle. Find
Problem 12
Find the number of nonempty subsets of such that the product of all the numbers in the subset is NOT divisible by .
Problem 13
If , find the maximum possible value of such that both of and are integers and
Problem 14
A square with side length is rotated about its center. The square would externally swept out identical small regions as it rotates. Find the area of one of the small region.
Problem 15
In a circle with a radius of , four arcs are drawn inside the circle. Smaller circles are inscribed inside the eye-shape diagrams. Let denote the area of the greatest circle that can be inscribed inside the unshaded region. and let denote the total area of unshaded region. Find
Problem 21
The exact value of can be expressed as which the fraction is in the most simplified form, and , , , and are not necessary distinct positive integers. Find
Problem 22
Given that on a complex plane, there is a polar coordinate . The point is rotated clockwise to form the new point , to form , and to form degrees around the origin. Evaluate:
Problem 23
Find the sum of last five digits of .
Problem 24
The Terminator is playing a game. He has a deck of card numbered from and he also has two dices. There are three green cards, three blue cards, and six orange cards. Terminator already knew that the three blue cards are but not necessary in this order, and the three green cards are in some order. Terminator will play this game two rounds by choose one card without replacement and roll the two dice. However, at the beginning of the second round, he MUST choose either by reroll one die , re-choose one card WITH replacement or re-choose the card and choose one die to reroll. He wins if in the first rounds his sum of the card number is equal to the sum of the numbers on the dice and in the second round the sum of numbers on the dice is greater than the card number. Given that terminator is a perfectionist and he always optimize his chance of winning. Find the probability that Terminator will replace only his card(He will replace the card and choose one die to reroll IF the probability of replace one card and reroll one die is equal.
Problem 25
All the solution of are vertices of a polygon. The smallest solution that when express in polar form, has a value greater than but smaller than can be expressed as which are all not necessarily distinct positive integers, in this case represents the imagenary number, , and the fraction is in the most simplified form. Find .