This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 5923

[b]p1.[/b] Find the last digit of $2022^{2022}$. [b]p2.[/b] Let $a_1 < a_2 <... < a_8$ be eight real numbers in an increasing arithmetic progression. If $a_1 + a_3 + a_5 + a_7 = 39$ and $a_2 + a_4 + a_6 + a_8 = 40$, determine the value of $a_1$. [b]p3.[/b] Patrick tries to evaluate the sum of the first $2022$ positive integers, but accidentally omits one of the numbers, $N$, while adding all of them manually, and incorrectly arrives at a multiple of $1000$. If adds correctly otherwise, find the sum of all possible values of $N$. [b]p4.[/b] A machine picks a real number uniformly at random from $[0, 2022]$. Andrew randomly chooses a real number from $[2020, 2022]$. The probability that Andrew’s number is less than the machine’s number is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]p5.[/b] Let $ABCD$ be a square and $P$ be a point inside it such that the distances from $P$ to sides $AB$ and $AD$ respectively are $2$ and $4$, while $PC = 6$. If the side length of the square can be expressed in the form $a +\sqrt{b}$ for positive integers $a, b$, then determine $a + b$. [b]p6.[/b] Positive integers $a_1, a_2, ..., a_{20}$ sum to $57$. Given that $M$ is the minimum possible value of the quantity $a_1!a_2!...a_{20}!$, find the number of positive integer divisors of $M$. [b]p7.[/b] Jessica has $16$ balls in a box, where $15$ of them are red and one is blue. Jessica draws balls out the box three at a time until one of the three is blue. If she ever draws three red marbles, she discards one of them and shuffles the remaining two back into the box. The expected number of draws it takes for Jessica to draw the blue ball can be written as a common fraction $\frac{m}{n}$ where $m, n$ are relatively prime positive integers. Find $m + n$. [b]p8.[/b] The Lucas sequence is defined by these conditions: $L_0 = 2$, $L_1 = 1$, and $L_{n+2} =L_{n+1} +L_n$ for all $n \ge 0$. Determine the remainder when $L^2_{2019} +L^2_{2020}$ is divided by $L_{2023}$. [b]p9.[/b] Let $ABCD$ be a parallelogram. Point $P$ is selected in its interior such that the distance from $P$ to $BC$ is exactly $6$ times the distance from $P$ to $AD$, and $\angle APB = \angle CPD = 90^o$. Given that $AP = 2$ and $CP = 9$, the area of $ABCD$ can be expressed as $m\sqrt{n}$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n$. [b]p10.[/b] Consider the polynomial $P(x) = x^{35} + ... + x + 1$. How many pairs $(i, j)$ of integers are there with $0 \le i < j \le 35$ such that if we flip the signs of the $x^i$ and $x^j$ terms in $P(x)$ to form a new polynomial $Q(x)$, then there exists a nonconstant polynomial $R(x)$ with integer coefficients dividing both $P(x)$ and $Q(x)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A sequence of numbers is [i]platense[/i] if the first number is greater than $1$, and $a_{n+1}=\frac{a_n}{p_n}$ which $p_n$ is the least prime divisor of $a_n$, and the sequence ends if $a_n=1$. For instance, the sequences $864, 432,216,108,54,27,9,3,1$ and $2022,1011,337,1$ are both sequence platense. A sequence platense is [i]cuboso[/i] if some term is a perfect cube greater than $1$. For instance, the sequence $864$ is cuboso, because $27=3^3$, and the sequence $2022$ is not cuboso, because there is no perfect cube. Determine the number of sequences cuboso which the initial term is less than $2022$.
Consider the sequence $ a_n\equal{}\sqrt[3]{n^3\plus{}3n^2\plus{}2n\plus{}1}\plus{}a\sqrt[5]{n^5\plus{}5n^4\plus{}1}\plus{}\frac{ln(e^{n^2}\plus{}n\plus{}2)}{n\plus{}2}\plus{}b$. Find $ a,b \in \mathbb{R}$ such that $ \displaystyle\lim_{n\to\infty}a_n\equal{}5$.
Define sequence $\{a_n\}$ as following: $a_0=0$, $a_1=1$, and $a_{i}=2a_{i-1}-a_{i-2}+2$ for all $i\geq 2$. Determine the value of $a_{1000}.$ [i] Proposed by Yannick Yao [/i]
Define the sequences $a_n$ and $b_n$ as follows: $a_1 = 2017$ and $b_1 = 1$. For $n > 1$, if there is a greatest integer $k > 1$ such that $a_n$ is a perfect $k$th power, then $a_{n+1} =\sqrt[k]{a_n}$, otherwise $a_{n+1} = a_n + b_n$. If $a_{n+1} \ge a_n$ then $b_{n+1} = b_n$, otherwise $b_{n+1} = b_n + 1$. Find $a_{2017}$.
Let $\{x_{n}\}_{n\ge0}$ and $\{y_{n}\}_{n\ge0}$ be two sequences defined recursively as follows \[x_{0}=1, \; x_{1}=4, \; x_{n+2}=3 x_{n+1}-x_{n},\] \[y_{0}=1, \; y_{1}=2, \; y_{n+2}=3 y_{n+1}-y_{n}.\] [list=a][*] Prove that ${x_{n}}^{2}-5{y_{n}}^{2}+4=0$ for all non-negative integers. [*] Suppose that $a$, $b$ are two positive integers such that $a^{2}-5b^{2}+4=0$. Prove that there exists a non-negative integer $k$ such that $a=x_{k}$ and $b=y_{k}$.[/list]
The sequence $\{x_n\}_{n=0}^\infty$ is defined by the following equations: $x_n=\sqrt{x_{n-1} x_{n-2}+\frac{n}{2}}$ ,$\forall$ $n\geq 2$, $x_0=x_1=1$. Prove that there exist a real number $a$, such that $an<x_n<an+1$ for each natural number $n$.
Let $x_0 = [a], x_1 = [2a] - [a], x_2 = [3a] - [2a], x_3 = [3a] - [4a],x_4 = [5a] - [4a],x_5 = [6a] - [5a], . . . , $ where $a=\frac{\sqrt{2013}}{\sqrt{2014}}$ .The value of $x_9$ is: (A): $2$ (B): $3$ (C): $4$ (D): $5$ (E): None of the above.
Does there exist an increasing sequence of positive integers for which any large enough integer can be expressed uniquely as the sum of two (possibly equal) terms of the sequence? [i]Proposed by Vlad Spătaru and David Anghel[/i]
Determine all sequences of non-negative integers $a_1, \ldots, a_{2016}$ all less than or equal to $2016$ satisfying $i+j\mid ia_i+ja_j$ for all $i, j\in \{ 1,2,\ldots, 2016\}$.
What is the $1992^\text{nd}$ letter in this sequence? \[\text{ABCDEDCBAABCDEDCBAABCDEDCBAABCDEDC}\cdots \] $\text{(A)}\ \text{A} \qquad \text{(B)}\ \text{B} \qquad \text{(C)}\ \text{C} \qquad \text{(D)}\ \text{D} \qquad \text{(E)}\ \text{E}$
Let $ \alpha(n)$ be the number of digits equal to one in the binary representation of a positive integer $ n.$ Prove that: (a) the inequality $ \alpha(n) (n^2 ) \leq \frac{1}{2} \alpha(n)(\alpha(n) + 1)$ holds; (b) the above inequality is an equality for infinitely many positive integers, and (c) there exists a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i }$ goes to zero as $ i$ goes to $ \infty.$ [i]Alternative problem:[/i] Prove that there exists a sequence a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i )}$ (d) $ \infty;$ (e) an arbitrary real number $ \gamma \in (0,1)$; (f) an arbitrary real number $ \gamma \geq 0$; as $ i$ goes to $ \infty.$
Positive real sequences $\{ a_n \}$ and $\{ b_n \}$ satisfy the following conditions for all positive integers $n$. [list] [*] $a_{n+1}b_{n+1}= a_n^2 + b_n^2$ [*] $a_{n+1}+b_{n+1}=a_nb_n$ [*] $a_n \geq b_n$ [/list] Prove that there exists positive integer $n$ such that $\frac{a_n}{b_n}>2023^{2023}.$
Sequence $\{ a_n \}$ satisfies: $a_1=3$, $a_2=7$, $a_n^2+5=a_{n-1}a_{n+1}$, $n \geq 2$. If $a_n+(-1)^n$ is prime, prove that there exists a nonnegative integer $m$ such that $n=3^m$.
Let $\{a_i\}_{i=1}^{\infty}$ be a sequence of positive integers such that $a_1<a_2<a_3\cdots$ and all of primes are members of this sequence. Prove that for every $n<m$ \[\dfrac{1}{a_n} + \dfrac{1}{a_{n+1}} + \cdots + \dfrac{1}{a_m} \not \in \mathbb N\]
For every sequence $ (x_1, x_2, \ldots, x_n)$ of non-zero natural prime numbers, $ \{1, 2, \ldots, n\}$ arranged in any order, denote by $ f(s)$ the sum of absolute values of the differences between two consecutive members of $ s.$ Find the maximum value of $ f(s)$ where $ s$ runs through the set of all such sequences, i.e. for all sequences $ s$ with the given properties.
A sequence of positive integer numbers $a_1,...,a_{100}$ such is that $a_1=1$, and for all $n=1, 2,...,100$ number $(a_1+...+a_n) \left ( \frac{1}{a_1}+...+\frac{1}{a_n} \right )$ is integer. What is the maximum value that can take $ a_{100}$? [i] M. Turevskii [/i]
Does there exist a sequence $ F(1), F(2), F(3), \ldots$ of non-negative integers that simultaneously satisfies the following three conditions? [b](a)[/b] Each of the integers $ 0, 1, 2, \ldots$ occurs in the sequence. [b](b)[/b] Each positive integer occurs in the sequence infinitely often. [b](c)[/b] For any $ n \geq 2,$ \[ F(F(n^{163})) \equal{} F(F(n)) \plus{} F(F(361)). \]
Let the sequence $u_n$ be defined by $u_0=0$ and $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for each $n\in\mathbb N_0$. (a) Calculate $u_{1990}$. (b) Find the number of indices $n\le1990$ for which $u_n=0$. (c) Let $p$ be a natural number and $N=(2^p-1)^2$. Find $u_N$.
Let $f(0), f(1), f(2), \dots$ be a sequence satisfying \[ f(0) = 0 \quad \text{and} \quad f(n) = n - f(f(n-1)) \] for $n=1,2,3,\dots$. Give a formula for $f(n)$ such that its value can be immediately computed using $n$ without having to compute the previous terms.
A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?
[u]Round 1[/u] [b]p1.[/b] Ten children arrive at a birthday party and leave their shoes by the door. All the children have different shoe sizes. Later, as they leave one at a time, each child randomly grabs a pair of shoes their size or larger. After some kids have left, all of the remaining shoes are too small for any of the remaining children. What is the greatest number of shoes that might remain by the door? [b]p2.[/b] Turans, the king of Saturn, invented a new language for his people. The alphabet has only $6$ letters: A, N, R, S, T, U; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the first word is SATURN. Which word follows immediately after TURANS? [b]p3.[/b] Benji chooses five integers. For each pair of these numbers, he writes down the pair's sum. Can all ten sums end with different digits? [b]p4.[/b] Nine dwarves live in a house with nine rooms arranged in a $3\times3$ square. On Monday morning, each dwarf rubs noses with the dwarves in the adjacent rooms that share a wall. On Monday night, all the dwarves switch rooms. On Tuesday morning, they again rub noses with their adjacent neighbors. On Tuesday night, they move again. On Wednesday morning, they rub noses for the last time. Show that there are still two dwarves who haven't rubbed noses with one another. [b]p5.[/b] Anna and Bobby take turns placing rooks in any empty square of a pyramid-shaped board with $100$ rows and $200$ columns. If a player places a rook in a square that can be attacked by a previously placed rook, he or she loses. Anna goes first. Can Bobby win no matter how well Anna plays? [img]https://cdn.artofproblemsolving.com/attachments/7/5/b253b655b6740b1e1310037da07a0df4dc9914.png[/img] [u]Round 2[/u] [b]p6.[/b] Some boys and girls, all of different ages, had a snowball fight. Each girl threw one snowball at every kid who was older than her. Each boy threw one snowball at every kid who was younger than him. Three friends were hit by the same number of snowballs, and everyone else took fewer hits than they did. Prove that at least one of the three is a girl. [b]p7.[/b] Last year, jugglers from around the world travelled to Jakarta to participate in the Jubilant Juggling Jamboree. The festival lasted $32$ days, with six solo performances scheduled each day. The organizers noticed that for any two days, there was exactly one juggler scheduled to perform on both days. No juggler performed more than once on a single day. Prove there was a juggler who performed every day. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.
We call a sequence of $n$ digits one or zero a code. Subsequence of a code is a palindrome if it is the same after we reverse the order of its digits. A palindrome is called nice if its digits occur consecutively in the code. (Code $(1101)$ contains $10$ palindromes, of which $6$ are nice.) a) What is the least number of palindromes in a code? b) What is the least number of nice palindromes in a code?
Consider the finite sequence $\left\lfloor \frac{k^2}{1998} \right\rfloor$, for $k=1,2,\ldots, 1997$. How many distinct terms are there in this sequence? [i]Greece[/i]