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: 1340

Let ${(a_n)_{n\ge1}} $ be a sequence with ${a_1 = 1} $ and ${a_{n+1} = \lfloor a_n +\sqrt{a_n}+\frac{1}{2}\rfloor }$ for all ${n \ge 1}$, where ${\lfloor x \rfloor}$ denotes the greatest integer less than or equal to ${x}$. Find all ${n \le 2013}$ such that ${a_n}$ is a perfect square
Let $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. Find $x$ such that $x\lfloor x\lfloor x\lfloor x\rfloor\rfloor \rfloor = 88$ [list=1] [*] $\pi$ [*] 3.14 [*] $\frac{22}{7}$ [*] All of these [/list]
Write using with the floor function: the last, the second last, and the first digit of the number $n$ written in the decimal system.
Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years. (a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end. (b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor + \left\lfloor \frac{4r}{r+b} \right\rfloor + ... + \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor . \] [i]Proposed by Sammy Luo[/i]
Prove that there are no $x\in\mathbb{R}^+$ such that $$x^{\lfloor x \rfloor }=\frac92.$$
Suppose $r$ is a real number for which \[ \left\lfloor r + \frac{19}{100} \right\rfloor + \left\lfloor r + \frac{20}{100} \right\rfloor + \left\lfloor r + \frac{21}{100} \right\rfloor + \cdots + \left\lfloor r + \frac{91}{100} \right\rfloor = 546. \] Find $\lfloor 100r \rfloor$. (For real $x$, $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.)
Let $ a,b$ be real nonzero numbers, such that number $ \lfloor an \plus{} b \rfloor$ is an even integer for every $ n \in \mathbb{N}$. Prove that $ a$ is an even integer.
There are 12 people such that for every person A and person B there exists a person C that is a friend to both of them. Determine the minimum number of pairs of friends and construct a graph where the edges represent friendships.
[b]p1.[/b] Compute $21 \cdot 21 - 20 \cdot 20$. [b]p2.[/b] A square has side length $2$. If the square is scaled by a factor of $n$, the perimeter of the new square is equal to the area of the original square. Find $10n$. [b]p3.[/b] Kevin has $2$ red marbles and $2$ blue marbles in a box. He randomly grabs two marbles. The probability that they are the same color can be expressed as $\frac{a}{b}$ for relatively prime integers $a$ and $b$. Find $a +b$. [b]p4.[/b] In a classroom, if the teacher splits the students into groups of $3$ or $4$, there is one student left out. If the students formgroups of $5$, every student is in a group. What is the fewest possible number of students in this classroom? [b]p5.[/b] Find the sum of all positive integer values of $x$ such that $\lfloor \sqrt{x!} \rfloor = x$. [b]p6.[/b] Find the number of positive integer factors of $2021^{(2^0+2^1)} \cdot 1202^{(1^2+0^2)}$. [b]p7.[/b] Let $n$ be the number of days over a $13$ year span. Find the difference between the greatest and least possible values of $n$. Note: All years divisible by $4$ are leap years unless they are divisible by 100 but not $400$. For example, $2000$ and $2004$ are leap years, but $1900$ is not. [b]p8.[/b] In isosceles $\vartriangle ABC$, $AB = AC$, and $\angle ABC = 72^o$. The bisector of $\angle ABC$ intersects $AC$ at $D$. Given that $BC = 30$, find $AD$. [b]p9.[/b] For an arbitrary positive value of $x$, let $h$ be the area of a regular hexagon with side length $x$ and let $s$ be the area of a square with side length $x$. Find the value of $\left \lfloor \frac{10h}{s} \right \rfloor$. [b]p10.[/b] There is a half-full tub of water with a base of $4$ inches by $5$ inches and a height of $8$ inches. When an infinitely long stick with base $1$ inch by $1$ inch is inserted vertically into the bottom of the tub, the number of inches the water level rises by can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p11.[/b] Find the sum of all $4$-digit numbers with digits that are a permutation of the digits in $2021$. Note that positive integers cannot have first digit $0$. [b]p12.[/b] A $10$-digit base $8$ integer is chosen at random. The probability that it has $30$ digits when written in base $2$ can be expressed as $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p13.[/b] Call a natural number sus if it can be expressed as $k^2 +k +1$ for some positive integer $k$. Find the sum of all sus integers less than $2021$. [b]p14.[/b] In isosceles triangle $ABC$, $D$ is the intersection of $AB$ and the perpendicular to $BC$ through $C$. Given that $CD = 5$ and $AB = BC = 1$, find $\sec^2 \angle ABC$. [b]p15.[/b] Every so often, the minute and hour hands of a clock point in the same direction. The second time this happens after 1:00 is a b minutes later, where a and b are relatively prime positive integers. Find a +b. [b]p16.[/b] The $999$-digit number $N = 123123...123$ is composed of $333$ iterations of the number $123$. Find the least nonnegative integerm such that $N +m$ is a multiple of $101$. [b]p17.[/b] The sum of the reciprocals of the divisors of $2520$ can be written as $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p18.[/b] Duncan, Paul, and $6$ Atreides guards are boarding three helicopters. Duncan, Paul, and the guards enter the helicopters at random, with the condition that Duncan and Paul do not enter the same helicopter. Note that not all helicoptersmust be occupied. The probability that Paul has more guards with him in his helicopter than Duncan does can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p19.[/b] Let the minimum possible distance from the origin to the parabola $y = x^2 -2021$ be $d$. The value of d2 can be expressed as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p20.[/b] In quadrilateral $ABCD$ with interior point $E$ and area $49 \sqrt3$, $\frac{BE}{CE}= 2 \sqrt3$, $\angle ABC = \angle BCD = 90^o$, and $\vartriangle ABC \sim \vartriangle BCD \sim \vartriangle BEC$. The length of $AD$ can be expressed aspn where $n$ is a positive integer. Find $n$. [b]p21.[/b] Find the value of $$\sum^{\infty}_{i=1}\left( \frac{i^2}{2^{i-1}}+\frac{i^2}{2^{i}}+\frac{i^2}{2^{i+1}}\right)=\left( \frac{1^2}{2^{0}}+\frac{1^2}{2^{1}}+\frac{1^2}{2^{2}}\right)+\left( \frac{2^2}{2^{1}}+\frac{2^2}{2^{2}}+\frac{2^2}{2^{3}}\right)+\left( \frac{3^2}{2^{2}}+\frac{2^2}{2^{3}}+\frac{2^2}{2^{4}}\right)+...$$ [b]p22.[/b] Five not necessarily distinct digits are randomly chosen in some order. Let the probability that they form a nondecreasing sequence be $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find the remainder when $a +b$ is divided by$ 1000$. [b]p23.[/b] Real numbers $a$, $b$, $c$, and d satisfy $$ac -bd = 33$$ $$ad +bc = 56.$$ Given that $a^2 +b^2 = 5$, find the sum of all possible values of $c^2 +d^2$. [b]p24.[/b] Jeff has a fair tetrahedral die with sides labeled $0$, $1$, $2$, and $3$. He continuously rolls the die and record the numbers rolled in that order. For example, if he rolls a $1$, then rolls a $2$, and then rolls a $3$, he writes down $123$. He keeps rolling the die until he writes the substring $2021$. What is the expected number of times he rolls the die? [b]p25.[/b] In triangle $ABC$, $BC = 2\sqrt3$, and $AB = AC = 4\sqrt3$. Circle $\omega$ with center $O$ is tangent to segment $AB$ at $T$ , and $\omega$ is also tangent to ray $CB$ past $B$ at another point. Points $O, T$ , and $C$ are collinear. Let $r$ be the radius of $\omega$. Given that $r^2 = \frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers, find $a +b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
We define a sequence ${a_n}$: $$a_1=1,a_{n+1}=\sqrt{a_n+n^2},n=1,2,...$$ (1)Find $\lfloor a_{2019}\rfloor$ (2)Find $\lfloor a_{1}^2\rfloor+\lfloor a_{2}^2\rfloor+...+\lfloor a_{20}^2\rfloor$
Let $n$ be a positive integer. We have $n$ boxes where each box contains a non-negative number of pebbles. In each move we are allowed to take two pebbles from a box we choose, throw away one of the pebbles and put the other pebble in another box we choose. An initial configuration of pebbles is called [i]solvable[/i] if it is possible to reach a configuration with no empty box, in a finite (possibly zero) number of moves. Determine all initial configurations of pebbles which are not solvable, but become solvable when an additional pebble is added to a box, no matter which box is chosen.
Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$) such that there exists a convex $n$-gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$.)
Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.
Players $1,2,\ldots n$ are seated around a table, and each has a single penny. Player $1$ passes a penny to Player $2$, who then passes two pennies to Player $3$, who then passes one penny to player $4$, who then passes two pennies to Player $5$ and so on, players alternately pass one or two pennies to the next player who still has some pennies. The player who runs out of pennies drops out of the game and leaves the table. Find an infinite set of numbers $n$ for which some player ends up with all the $n$ pennies.
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$. For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$. Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible). Sorry for my bad English.
The National Foundation of Happiness (NFoH) wants to estimate the happiness of people of country. NFoH selected $n$ random persons, and on every morning asked from each of them whether she is happy or not. On any two distinct days, exactly half of the persons gave the same answer. Show that after $k$ days, there were at most $n-\frac{n}{k}$ persons whose “yes” answers equals their “no” answers.
Find the number of 5-digit numbers that each contains the block '15' and is divisible by 15.
Find all integers $n$ such that $\left[\frac{n}{1!}\right] + \left[\frac{n}{2!}\right] + ... + \left[\frac{n}{10!}\right] = 1001$.
The symbolism $ \lfloor x\rfloor$ denotes the largest integer not exceeding $ x$. For example. $ \lfloor3\rfloor\equal{}3$, and $ \lfloor 9/2\rfloor\equal{}4$. Compute \[ \lfloor\sqrt1\rfloor\plus{}\lfloor\sqrt2\rfloor\plus{}\lfloor\sqrt3\rfloor\plus{}\cdots\plus{}\lfloor\sqrt{16}\rfloor. \]$ \textbf{(A)}\ 35 \qquad \textbf{(B)}\ 38 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 42 \qquad \textbf{(E)}\ 136$
Members of "Professionous Riddlous" society have been divided into some groups, and groups are changed in a special way each weekend: In each group, one of the members is specified as the best member, and the best members of all groups separate from their previous group and form a new group. If a group has only one member, that member joins the new group and the previous group will be removed. Suppose that the society has $n$ members at first, and all the members are in one group. Prove that a week will come, after which number of members of each group will be at most $1+\sqrt{2n}$.
Prove that the parity of each term of the sequence $ \left( \left\lfloor \left( \lfloor \sqrt q \rfloor +\sqrt{q} \right)^n \right\rfloor \right)_{n\ge 1} $ is opposite to the parity of its index, where $ q $ is a squarefree natural number.
Show that for each positive integer n, \[n!=\prod_{i=1}^n \; \text{lcm} \; \{1, 2, \ldots, \left\lfloor\frac{n}{i} \right\rfloor\}\] (Here lcm denotes the least common multiple, and $\lfloor x\rfloor$ denotes the greatest integer $\le x$.)
Let $n$ be a positive integer greater than 4 such that the decimal representation of $n!$ ends in $k$ zeros and the decimal representation of $(2n)!$ ends in $3k$ zeros. Let $s$ denote the sum of the four least possible values of $n$. What is the sum of the digits of $s$? $ \textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11 $