2021 MECC Mock AMC 10
- 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
Define a binary operation . Find the number of possible ordered pair of positive integers such that .
can be expressed as . Find .
Compute the number of ways to arrange 2 distinguishable apples and five indistinguishable books.
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 .
Let be a sequence of positive integers with and and for all integers such that . Find .
Find the sum of all the solutions of , where can be any number. The roots may be repeated.
Define the number of real numbers such that is a perfect square. Find .
A unit cube ABCDEFGH is shown below. is reflected across the plane that contains line and line . Then, it is reflected again across the plane that contains line and . Call the new point . Find .
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 .
Find the remainder when expressed in base is divided by .
Let be a term sequence of positive integers such that ,, , , . Find the number of such sequences such that all of .
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.
Find the number of nonempty subsets of such that the product of all the numbers in the subset is NOT divisible by .
Given that , , and , find .
Josh is playing a game. There are eight cards, each numbered from . Josh would choose cards arbitrary with replacement. Given that the four numbers are , find the probability that is a multiple of but a factor of .
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
There exists a polynomial which and are both integers. How many of the following statements are true about all quadratics ?
1. For every possible , there are at least of them such that but two quadratic that if the such has all integer roots.
2. For all roots of any quadratic in , there exists infinite number of quadratic such that if and only if has all real solutions and all terms of are real numbers.
3. For any quadratics in , there exists at least one quadratics such that they shares exactly one of the roots of and all of the roots are positive integers.
Find the number of positive integers that are less than or equal to such that is a four digit terminating decimal which .
In a square with length , two overlapping quarter circle centered at two of the vertices of the square is drawn. Find the ratio of the shaded region to the area of the entire square.
In square with side length , equilateral triangles are drawn externally on each side of the square. Additionally, arcs are drawn inside the square. A circle with center is externally tangent to all the four arcs in the square. Let the midpoint of be . The secant cuts circle . The probability that a randomly chosen point on line segment will be a point on the portion that cuts through the circle can be expressed as which and are square-free. Find .
There exists an increasing sequence of positive integers such that the value of can be expressed which is a prime number and are integers as small as possible. Find the sum of .
Given that . Find . (*Note that is the largest possible product of , and is the smallest possible product of .)
Find the sum of last five digits of .
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 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.