What value of $x$ satisfies $$x- \frac{3}{4} = \frac{5}{12} - \frac{1}{3}?$$

The numbers $3, 5, 7, a,$ and $b$ have an average (arithmetic mean) of $15.$ What is the average of $a$ and $b?$

Assuming $a\neq3,$ $b\neq4,$ and $c\neq5,$ what is the value in simplest form of the following expression? $$\frac{a-3}{5-c} \cdot \frac{b-4}{3-a} \cdot \frac{c-5}{4-b}$$

A driver travels for $2$ hours at $60$ miles per hour, during which her car gets $30$ miles per gallon of gasoline. She is paid $\$0.50$ per mile, and her only expense is gasoline at $\$2.00$ per gallon. What is her net rate of pay, in dollars per hour, after this expense?

What is the sum of all real numbers $x$ for which $$|x^2-12x+34|=2?$$

How many $4$-digit positive integers (that is, integers between $1000$ and $9999,$ inclusive) having only even digits are divisible by $5?$

The $25$ integers from $-10$ to $14,$ inclusive, can be arranged to form a $5$-by-$5$ square in which the sum of the numbers in each row, the sum of the numbers in each column, and the sum of the numbers along each of the main diagonals are all the same. What is the value of this common sum?

What is the value of $$\begin{align*} &1+2+3-4 +5+6+7-8\\ &+\cdots+197+198+199-200? \end{align*}$$

A single bench section at a school event can hold either $7$ adults or $11$ children. When $N$ bench sections are connected end to end, an equal number of adults and children seated together will occupy all the bench space. What is the least possible positive integer value of $N?$

Seven cubes, whose volumes are $1,$ $8,$ $27,$ $64,$ $125,$ $216,$ and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?

What is the median of the following list of $4040$ numbers$?$ $$\begin{align*} &1, 2, 3, \ldots, 2020, \\&1^2, 2^2, 3^2, \ldots, 2020^2 \end{align*}$$

Triangle $AMC$ is isosceles with $AM = AC.$ Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12.$ What is the area of $\triangle AMC?$

A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1,$ and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0, 0),$ $(0, 4),$ $(4, 4),$ and $(4, 0).$ What is the probability that the sequence of jumps ends on a vertical side of the square?

Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2.$ What is the value of

$$x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?$$

A positive integer divisor of $12!$ is chosen at random. The probability that the divisor chosen is a perfect square can be expressed as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. What is $m+n?$

A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0),$ $(2020, 0),$ $(2020, 2020),$ and $(0, 2020).$ The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}.$ (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth$?$

Define $$\begin{align*} P(x) =&(x-1^2)(x-2^2)\\&\cdots(x-100^2) \end{align*}$$ How many integers $n$ are there such that $P(n)\leq 0?$

Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\{0,1,2,3\}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)

As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring?

Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$

There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that$$\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.$$What is $k?$

For how many positive integers $n \le 1000$ is$$\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor$$not divisible by $3?$ (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x.$)

Let $T$ be the triangle in the coordinate plane with vertices $(0,0), (4,0),$ and $(0,3).$ Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}, 180^{\circ},$ and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.)

Let $n$ be the least positive integer greater than $1000$ for which

$$\gcd(63, n+120) =21$$

and

$$\gcd(n+63, 120)=60.$$

What is the sum of the digits of $n?$

Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7.$ Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice?