Problems

Consider the sequence of positive integers $$1,2,1,2,3,2,1,2,3,4,3,2,1,2,3,4,5,4,3,2,1,2,3,4,5,6,5,4,3,2,1,2,\dots$$ What is the $2025$ th term in this sequence?

An array of numbers is constructed beginning with the numbers $-1\qquad3\qquad1$ in the top row. Each adjacent pair of numbers is summed to produce a number in the next row. Each row begins and ends with $-1$ and $1$ , respectively. \[\begin{array}{ccccccccc} &&-1&&3&&1&&\\ &-1&&2&&4&&1&\\ -1&&1&&6&&5&&1\\ …

Jerry wrote down the ones digit of each of the first $2025$ positive squares: $1,4,9,6,5,6,\dots$ . What is the sum of all the numbers Jerry wrote down?

A Pascal-like triangle has $10$ as the top row and $10$ followed by $1$ as the second row. In each subsequent row the first number is $10$ , the last number is $1$ , and, as in the standard Pascal's Triangle, each other number in the row is the sum of the two numbers directly above it. The first four rows are shown …

What is the ones digit of the sum $$\lfloor \sqrt{1} \rfloor + \lfloor \sqrt{2} \rfloor + \lfloor \sqrt{3} \rfloor + \dots + \lfloor \sqrt{2025} \rfloor?$$ (Recall that $\lfloor x \rfloor$ represents the greatest integer less than or equal to $x$ .)

What is the minimum number of successive swaps of adjacent letters in the string $ABCDEF$ that are needed to change the string to $FEDCBA?$ (For example, $3$ swaps are required to change $ABC$ to $CBA;$ one such sequence of swaps is $ABC\to BAC\to BCA\to CBA.$ )

Consider the following operation. Given a positive integer $n$ , if $n$ is a multiple of $3$ , then you replace $n$ by $\frac{n}{3}$ . If $n$ is not a multiple of $3$ , then you replace $n$ by $n+10$ . For example, beginning with $n=4$ , this procedure gives $4\to14\to24\to8\to18\to6\to2\to12\to\cdots$ . Suppose you …

Let $S$ be a subset of $\{1, 2, 3, \dots, 2024\}$ such that the following two conditions hold: - If $x$ and $y$ are distinct elements of $S$ , then $|x-y| > 2.$ - If $x$ and $y$ are distinct odd elements of $S$ , then $|x-y| > 6.$ What is the maximum possible number of elements in $S$ ?

In a long line of people arranged left to right, the 1013th person from the left is also the 1010th person from the right. How many people are in the line?

The Fibonacci numbers are defined by $F_1 = 1, F_2 = 1,$ and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 3.$ What is $${\frac{F_2}{F_1}} + {\frac{F_4}{F_2}} + {\frac{F_6}{F_3}} + ... + {\frac{F_{20}}{F_{10}}}?$$

Let $L_1 = 1$ , $L_2 = 3$ , and $L_{n+2} = L_{n+1}+L_n$ for $n \geq 1$ . How many terms in the sequence $L_1, L_2, L_3, \cdots, L_{2023}$ are even?

What is the units digit of $2022^{2023} + 2023^{2022}$ ?

When the roots of the polynomial $$P(x) = (x-1)^1 (x-2)^2 (x-3)^3 \cdot \cdot \cdot (x-10)^{10}$$ are removed from the number line, what remains is the union of $11$ disjoint open intervals. On how many of these intervals is $P(x)$ positive?

Let $T_k$ be the transformation of the coordinate plane that first rotates the plane $k$ degrees counterclockwise around the origin and then reflects the plane across the $y$ -axis. What is the least positive integer $n$ such that performing the sequence of transformations $T_1, T_2, T_3,...,T_n$ returns the point …

How many strings of length $5$ formed from the digits $0$ , $1$ , $2$ , $3$ , $4$ are there such that for each $j \in \{1,2,3,4\}$ , at least $j$ of the digits are less than $j$ ? (For example, $02214$ satisfies this condition because it contains at least $1$ digit less than $1$ , at least $2$ digits less than $2$ , at …

How many of the first ten numbers of the sequence $121, 11211, 1112111, \ldots$ are prime numbers?

Let $x_0,x_1,x_2,\dotsc$ be a sequence of numbers, where each $x_k$ is either $0$ or $1$ . For each positive integer $n$ , define $$S_n = \sum_{k=0}^{n-1} x_k 2^k$$ Suppose $7S_n \equiv 1 \pmod{2^n}$ for all $n \geq 1$ . What is the value of the sum $$x_{2019} + 2x_{2020} + 4x_{2021} + 8x_{2022}?$$

Mr. Zhou places all the integers from $1$ to $225$ into a $15$ by $15$ grid. He places $1$ in the middle square (eighth row and eighth column) and places other numbers one by one clockwise, as shown in part in the diagram below. What is the sum of the greatest number and the least number that appear in the second row …

For each positive integer $n$ , let $f_1(n)$ be twice the number of positive integer divisors of $n$ , and for $j \ge 2$ , let $f_j(n) = f_1(f_{j-1}(n))$ . For how many values of $n \le 50$ is $f_{50}(n) = 12?$

What is the value of $$1+2+3-4+5+6+7-8+\cdots+197+198+199-200?$$

Define $$P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).$$ How many integers $n$ are there such that $P(n)\leq 0$ ?

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?$

Andy the Ant lives on a coordinate plane and is currently at $(-20, 20)$ facing east (that is, in the positive $x$ -direction). Andy moves $1$ unit and then turns $90^{\circ}$ left. From there, Andy moves $2$ units (north) and then turns $90^{\circ}$ left. He then moves $3$ units (west) and again turns $90^{\circ}$ …

Steve wrote the digits $1$ , $2$ , $3$ , $4$ , and $5$ in order repeatedly from left to right, forming a list of $10,000$ digits, beginning $123451234512\ldots.$ He then erased every third digit from his list (that is, the $3$ rd, $6$ th, $9$ th, $\ldots$ digits from the left), then erased every fourth digit from the …

A sequence of numbers is defined recursively by $a_1 = 1$ , $a_2 = \frac{3}{7}$ , and $$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$ for all $n \geq 3$ . Then $a_{2019}$ can be written as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. What is $p+q ?$