Found problems: 5923
Let $ F:\mathbb{R}\longrightarrow\mathbb{R} $ be a primitive with $ F(0)=0 $ of the function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ defined as $ f(x)=\sin (x^2) , $ and let be a sequence $ \left( a_n \right)_{n\ge 0} $ with $ a_0\in (0,1) $ and defined as $ a_{n}=a_{n-1}-F\left( a_{n-1} \right) . $
Calculate $ \lim_{n\to\infty } a_n\sqrt{n} . $
[i]Florian Dumitrel[/i]
Define the sequence $(x_n)$ by $x_0 = 0$ and for all $n \in \mathbb N,$
\[x_n=\begin{cases} x_{n-1} + (3^r - 1)/2,&\mbox{ if } n = 3^{r-1}(3k + 1);\\ x_{n-1} - (3^r + 1)/2, & \mbox{ if } n = 3^{r-1}(3k + 2).\end{cases}\]
where $k \in \mathbb N_0, r \in \mathbb N$. Prove that every integer occurs in this sequence exactly once.
Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term beginning with the third is the sum of the previous two terms, and the seventh term of each sequence is $N$. What is the smallest possible value of $N$?
${ \textbf{(A)}\ 55\qquad\textbf{(B)}\ 89\qquad\textbf{(C)}\ 104\qquad\textbf{(D}}\ 144\qquad\textbf{(E)}\ 273 $
From a fixed set formed by the first consecutive natural numbers, find the number of subsets having exactly three elements, and these in arithmetic progression.
For each positive integer $n$, let $I_n$ denote the number of integers $p$ for which $50^n<7^p<50^{n+1}$.
(a) Prove that, for each $n$, $I_n$ is either $2$ or $3$.
(b) Prove that $I_n=3$ for infinitely many $n\in\mathbb N$, and find at least one such $n$.
Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence.
[list]
[*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence.
[*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list]
[i]Mitchell Lee and Benjamin Gunby.[/i]
Let there be a sequence $a_n$ such that $a_1 = 2,a_2 = 0, a_3 = 1, a_4 = 0$, and for $n \ge 1, a_{n+4}$ is the remainder when $a_n + 2a_{n+1} + 3a_{n+2} + 4a_{n+3}$ is divided by $9$. Prove that there are no positive integer $k$ such that $$a_k = 0, a_{k+1} = 1, a_{k+2} = 0,a_{k+3} = 2.$$
Let $\{a_n\}$ be a sequence of integers satisfying the following conditions.
[list]
[*] $a_1=2021^{2021}$
[*] $0 \le a_k < k$ for all integers $k \ge 2$
[*] $a_1-a_2+a_3-a_4+ \cdots + (-1)^{k+1}a_k$ is multiple of $k$ for all positive integers $k$.
[/list]
Determine the $2021^{2022}$th term of the sequence $\{a_n\}$.
A sequence of integers $ a_1,a_2,a_3,...$ is such that $ a_1\equal{}2, a_2\equal{}3$, and
$ a_{n\plus{}1}\equal{}2a_{n\minus{}1}$ or $ 3a_n\minus{}2a_{n\minus{}1}$ for all $ n \ge 2$.
Prove that no number between $ 1600$ and $ 2000$ can be an element of the sequence.
[b]p1.[/b] Fun facts! We know that $1008^2-1007^2 = 1008+1007$ and $1009^2-1008^2 = 1009+1008$. Now compute the following: $$1010^2 - 1009^2 - 1.$$
[b]p2.[/b] Let $m$ be the smallest positive multiple of $2018$ such that the fraction $m/2019$ can be simplified. What is the number $m$?
[b]p3.[/b] Given that $n$ satisfies the following equation $$n + 3n + 5n + 7n + 9n = 200,$$ find $n$.
[b]p4.[/b] Grace and Somya each have a collection of coins worth a dollar. Both Grace and Somya have quarters, dimes, nickels and pennies. Serena then observes that Grace has the least number of coins possible to make one dollar and Somya has the most number of coins possible. If Grace has $G$ coins and Somya has $S$ coins, what is $G + S$?
[b]p5.[/b] What is the ones digit of $2018^{2018}$?
[b]p6.[/b] Kaitlyn plays a number game. Each time when Kaitlyn has a number, if it is even, she divides it by $2$, and if it is odd, she multiplies it by $5$ and adds $1$. Kaitlyn then takes the resulting number and continues the process until she reaches $1$. For example, if she begins with $3$, she finds the sequence of $6$ numbers to be $$3, 3 \cdot 5 + 1 = 16, 16/2 = 8, 8/2 = 4, 4/2 = 2, 2/2 = 1.$$ If Kaitlyn's starting number is $51$, how many numbers are in her sequence, including the starting number and the number $1$?
[b]p7.[/b] Andrew likes both geometry and piano. His piano has $88$ keys, $x$ of which are white and $y$ of which are black. Each white key has area $3$ and each black key has area $11$. If the keys of his piano have combined area $880$, how many black keys does he have?
[b]p8.[/b] A six-sided die contains the numbers $1$, $2$, $3$, $4$, $5$, and $6$ on its faces. If numbers on opposite faces of a die always sum to $7$, how many distinct dice are possible? (Two dice are considered the same if one can be rotated to obtain the other.)
[b]p9.[/b] In $\vartriangle ABC$, $AB$ is $12$ and $AC$ is $15$. Alex draws the angle bisector of $BAC$, $AD$, such that $D$ is on $BC$. If $CD$ is $10$, then the area of $\vartriangle ABC$ can be expressed in the form $\frac{m \sqrt{n}}{p}$ where $m, p$ are relatively prime and $n$ is not divisible by the square of any prime. Find $m + n + p$.
[b]p10.[/b] Find the smallest positive integer that leaves a remainder of $2$ when divided by $5$, a remainder of $3$ when divided by $6$, a remainder of $4$ when divided by $7$, and a remainder of $5$ when divided by $8$.
[b]p11.[/b] Chris has a bag with $4$ marbles. Each minute, Chris randomly selects a marble out of the bag and flips a coin. If the coin comes up heads, Chris puts the marble back in the bag, while if the coin comes up tails, Chris sets the marble aside. What is the expected number of seconds it will take Chris to empty the bag?
[b]p12.[/b] A real fixed point $x$ of a function $f(x)$ is a real number such that $f(x) = x$. Find the absolute value of the product of the real fixed points of the function $f(x) = x^4 + x - 16$.
[b]p13.[/b] A triangle with angles $30^o$, $75^o$, $75^o$ is inscribed in a circle with radius $1$. The area of the triangle can be expressed as $\frac{a+\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime. Find $a + b + c$.
[b]p14.[/b] Dora and Charlotte are playing a game involving flipping coins. On a player's turn, she first chooses a probability of the coin landing heads between $\frac14$ and $\frac34$ , and the coin magically flips heads with that probability. The player then flips this coin until the coin lands heads, at which point her turn ends. The game ends the first time someone flips heads on an odd-numbered flip. The last player to flip the coin wins. If both players are playing optimally and Dora goes first, let the probability that Charlotte win the game be $\frac{a}{b}$ . Find $a \cdot b$.
[b]p15.[/b] Jonny is trying to sort a list of numbers in ascending order by swapping pairs of numbers. For example, if he has the list $1$, $4$, $3$, $2$, Jonny would swap $2$ and $4$ to obtain $1$, $2$, $3$, $4$. If Jonny is given a random list of $400$ distinct numbers, let $x$ be the expected minimum number of swaps he needs. Compute $\left \lfloor \frac{x}{20} \right \rfloor$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
The sequence of Fibonnaci's numbers if defined from the two first digits $f_1=f_2=1$ and the formula $f_{n+2}=f_{n+1}+f_n$, $\forall n \in N$.
[b](a)[/b] Prove that $f_{2010} $ is divisible by $10$.
[b](b)[/b] Is $f_{1005}$ divisible by $4$?
Albanian National Mathematical Olympiad 2010---12 GRADE Question 4.
Let $ \{a_k\}^{\infty}_1$ be a sequence of non-negative real numbers such that:
\[ a_k \minus{} 2 a_{k \plus{} 1} \plus{} a_{k \plus{} 2} \geq 0
\]
and $ \sum^k_{j \equal{} 1} a_j \leq 1$ for all $ k \equal{} 1,2, \ldots$. Prove that:
\[ 0 \leq a_{k} \minus{} a_{k \plus{} 1} < \frac {2}{k^2}
\]
for all $ k \equal{} 1,2, \ldots$.
Ali defines a [i]pronunciation[/i] of any sequence of English letters to be a partition of those letters into substrings such that each substring contains at least one vowel. For example, $\text{A } \vert \text{ THEN } \vert \text{ A}$, $\text{ATH } \vert \text{ E } \vert \text{ NA}$, $\text{ATHENA}$, and $\text{AT } \vert \text{ HEN } \vert \text{ A}$ are all pronunciations of the sequence $\text{ATHENA}$. How many distinct pronunciations does $\text{YALEMATHCOMP}$ have? (Y is not a vowel.)
[i]Proposed by Andrew Wu, with significant inspiration from ali cy[/i]
Let $S$ be the set of all lattice points $(x, y)$ in the plane satisfying $|x|+|y|\le 10$. Let $P_1,P_2,\ldots,P_{2013}$ be a sequence of 2013 (not necessarily distinct) points such that for every point $Q$ in $S$, there exists at least one index $i$ such that $1\le i\le 2013$ and $P_i = Q$. Suppose that the minimum possible value of $|P_1P_2|+|P_2P_3|+\cdots+|P_{2012}P_{2013}|$ can be expressed in the form $a+b\sqrt{c}$, where $a,b,c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a+b+c$. (A [i]lattice point[/i] is a point with all integer coordinates.)
[hide="Clarifications"]
[list]
[*] $k = 2013$, i.e. the problem should read, ``... there exists at least one index $i$ such that $1\le i\le 2013$ ...''. An earlier version of the test read $1 \le i \le k$.[/list][/hide]
[i]Anderson Wang[/i]
IMONST = [b]I[/b]nternational [b]M[/b]athematical [b]O[/b]lympiad [b]N[/b]ational [b]S[/b]election [b]T[/b]est
Malaysia 2020 Round 1 Juniors
Time: 2.5 hours [hide=Rules]
$\bullet$ For each problem you have to submit the answer only. The answer to each problem is a non-negative integer.
$\bullet$ No mark is deducted for a wrong answer.
$\bullet$ The maximum number of points is (1 + 2 + 3 + 4) x 5 = 50 points.[/hide]
[b]Part A[/b] (1 point each)
p1. The number $N$ is the smallest positive integer with the sum of its digits equal to $2020$. What is the first (leftmost) digit of $N$?
p2. At a food stall, the price of $16$ banana fritters is $k$ RM , and the price of $k$ banana fritters is $ 1$ RM . What is the price of one banana fritter, in sen?
Note: $1$ RM is equal to $100$ sen.
p3. Given a trapezium $ABCD$ with $AD \parallel$ to $BC$, and $\angle A = \angle B = 90^o$. It is known that the area of the trapezium is 3 times the area of $\vartriangle ABD$. Find $$\frac{area \,\, of \,\, \vartriangle ABC}{area \,\, of \,\, \vartriangle ABD}.$$
p4. Each $\vartriangle$ symbol in the expression below can be substituted either with $+$ or $-$: $$\vartriangle 1 \vartriangle 2 \vartriangle 3 \vartriangle 4.$$ How many possible values are there for the resulting arithmetic expression?
Note: One possible value is $-2$, which equals $-1 - 2 - 3 + 4$.
p5. How many $3$-digit numbers have its sum of digits equal to $4$?
[b]Part B[/b] (2 points each)
p6. Find the value of $$+1 + 2 + 3 - 4 - 5 - 6 + 7 + 8 + 9 - 10 - 11 - 12 +... - 2020$$ where the sign alternates between $+$ and $-$ after every three numbers.
p7. If Natalie cuts a round pizza with $4$ straight cuts, what is the maximum number of pieces that she can get?
Note: Assume that all the cuts are vertical (perpendicular to the surface of the pizza). She cannot move the pizza pieces until she finishes cutting.
p8. Given a square with area $ A$. A circle lies inside the square, such that the circle touches all sides of the square. Another square with area $ B$ lies inside the circle, such that all its vertices lie on the circle. Find the value of $A/B$.
p9. This sequence lists the perfect squares in increasing order: $$0, 1, 4, 9, 16, ... ,a, 10^8, b, ...$$ Determine the value of $b - a$.
p10. Determine the last digit of $5^5 + 6^6 + 7^7 + 8^8 + 9^9$.
[b]Part C[/b] (3 points each)
p11. Find the sum of all integers between $-\sqrt{1442}$ and $\sqrt{2020}$.
p12. Three brothers own a painting company called Tiga Abdul Enterprise. They are hired to paint a building.
Wahab says, "I can paint this building in $3$ months if I work alone". Wahib says, "I can paint this building in $2$ months if I work alone". Wahub says, "I can paint this building in $k$ months if I work alone". If they work together, they can finish painting the building in $1$ month only. What is $k$?
p13. Given a rectangle $ABCD$ with a point $P$ inside it. It is known that $PA = 17$, $PB = 15$, and $PC = 6$. What is the length of $PD$?
p14. What is the smallest positive multiple of $225$ that can be written using digits $0$ and $ 1$ only?
p15. Given positive integers $a, b$, and $c$ with $a + b + c = 20$. Determine the number of possible integer values for $\frac{a + b}{c}$.
[b]Part D[/b] (4 points each)
p16. If we divide $2020$ by a prime $p$, the remainder is $6$. Determine the largest possible value of $p$.
p17. A football is made by sewing together some black and white leather patches. The black patches are regular pentagons of the same size. The white patches are regular hexagons of the same size. Each pentagon is bordered by $5$ hexagons. Each hexagons is bordered by $3$ pentagons and $3$ hexagons. We need $12$ pentagons to make one football. How many hexagons are needed to make one football?
p18. Given a right-angled triangle with perimeter $18$. The sum of the squares of the three side lengths is $128$. What is the area of the triangle?
p19. A perfect square ends with the same two digits. How many possible values of this digit are there?
p20. Find the sum of all integers $n$ that fulfill the equation $2^n(6 - n) = 8n$.
Each of the small squares of a $50\times 50$ table is coloured in red or blue. Initially all squares are red. A [i]step[/i] means changing the colour of all squares on a row or on a column.
a) Prove that there exists no sequence of steps, such that at the end there are exactly $2011$ blue squares.
b) Describe a sequence of steps, such that at the end exactly $2010$ squares are blue.
[i]Adriana & Lucian Dragomir[/i]
Alice and Bob play a game. Bob starts by picking a set $S$ consisting of $M$ vectors of length $n$ with entries either $0$ or $1$. Alice picks a sequence of numbers $y_1\le y_2\le\dots\le y_n$ from the interval $[0,1]$, and a choice of real numbers $x_1,x_2\dots,x_n\in \mathbb{R}$. Bob wins if he can pick a vector $(z_1,z_2,\dots,z_n)\in S$ such that $$\sum_{i=1}^n x_iy_i\le \sum_{i=1}^n x_iz_i,$$otherwise Alice wins. Determine the minimum value of $M$ so that Bob can guarantee a win.
[i]Proposed by DVDthe1st[/i]
On a circle, $n \geq 3$ points are marked. Each marked point is coloured red, green or blue. In one step, one can erase two neighbouring marked points of different colours and mark a new point between the locations of the erased points with the third colour. In a final state, all marked points have the same colour which is called the colour of the final state. Find all $n$ for which there exists an initial state of $n$ marked points with one missing colour, from which one can reach a final state of any of the three colours by applying a suitable sequence of steps.
Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ .
[i]Proposed by Austria[/i]
A sequence $\{x_n \}=x_0, x_1, x_2, \cdots $ satisfies $x_0=a(1\le a \le 2019, a \in \mathbb{R})$, and $$x_{n+1}=\begin{cases}1+1009x_n &\ (x_n \le 2) \\ 2021-x_n &\ (2<x_n \le 1010) \\ 3031-2x_n &\ (1010<x\le 1011) \\ 2020-x_n &\ (1011<x_n) \end{cases}$$ for each non-negative integer $n$. If there exist some integer $k>1$ such that $x_k=a$, call such minimum $k$ a [i] fundamental period[/i] of $\{x_n \}$. Find all integers which can be a fundamental period of some seqeunce; and for such minimal odd period $k(>1)$, find all values of $x_0=a$ such that the fundamental period of $\{x_n \}$ equals $k$.
Consider all positive integers written in a row: $123456789101112131415...$ Find the $206788$-th digit from the left.
Let $f(x)$ be a nonconstant real polynomial. The sequence $\{a_i\}_{i=1}^{\infty}$ of real numbers is strictly increasing and unbounded, as
$$a_{i+1}<a_i+2020.$$
The integers $\lfloor{|f(a_1)|}\rfloor$ , $\lfloor{|f(a_2)|}\rfloor$ , $\lfloor{|f(a_3)|}\rfloor$ , $\dots$ are written consecutively in such a way that their digits form an infinite sequence of digits $\{s_k\}_{k=1}^{\infty}$ (here $s_k\in\{0, 1, \dots, 9\}$).
$\quad$If $n\in\mathbb{N}$ , prove that among the numbers $\overline{s_{n(k-1)+1}s_{n(k-1)+2}\cdots s_{nk}}$ , where $k\in\mathbb{N}$ , all $n$-digit numbers appear.
Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\ge 1,$ find the minimum possible value of $|x_1+x_2+\cdots+x_{2006}|$.
Let $N$ be the number of ordered triples $(A,B,C)$ of integers satisfying the conditions
(a) $0\leq A<B<C\leq99$,
(b) there exist integers $a$, $b$, and $c$, and prime $p$ where $0\leq b < a < c < p$,
(c) $p$ divides $A-a$, $B-b$, and $C-c$, and
(d) each ordered triple $(A,B,C)$ and each ordered triple $(b,a,c)$ form arithmetic sequences.
Find $N$.
In an infinite sequence $\{\alpha\}, \{\alpha^2\}, \{\alpha^3\}, \cdots $ there are finitely many distinct values$.$ Show that $\alpha$ is an integer$. (\{x\}$ denotes the fractional part of$ x.)$
[i](Golovanov A.S.)[/i]