Found problems: 373
Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$
Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.
Let $A$ be an infinite subset of the set of natural numbers, and denote by $\tau_A(n)$ the number of divisors of $n$ in $A$. Construct a set $A$ for which
$$\sum_{n\le x}\tau_A(n)=x+O(\log\log x)$$
and show that there is no set for which the error term is $o(\log\log x)$ in the above formula.
(translated by Miklós Maróti)
$g$ and $n$ are natural numbers such that $gcd(g^2-g,n)=1$ and $A=\{g^i|i \in \mathbb N\}$ and $B=\{x\equiv (n)|x\in A\}$(by $x\equiv (n)$ we mean a number from the set $\{0,1,...,n-1\}$ which is congruent with $x$ modulo $n$). if for $0\le i\le g-1$
$a_i=|[\frac{ni}{g},\frac{n(i+1)}{g})\cap B|$
prove that $g-1|\sum_{i=0}^{g-1}ia_i$.( the symbol $|$ $|$ means the number of elements of the set)($\frac{100}{6}$ points)
the exam time was 4 hours
For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$
[i]Proposed by Shahjalal Shohag, Bangladesh[/i]
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.
What is the value of \[\displaystyle\frac{1}{3}\cdot\displaystyle\frac{2}{4}\cdot\displaystyle\frac{3}{5}\cdots\displaystyle\frac{18}{20}\cdot\displaystyle\frac{19}{21}\cdot\displaystyle\frac{20}{22}?\]
$\textbf{(A)} ~\displaystyle\frac{1}{462}\qquad\textbf{(B)} ~\displaystyle\frac{1}{231}\qquad\textbf{(C)} ~\displaystyle\frac{1}{132}\qquad\textbf{(D)} ~\displaystyle\frac{2}{213}\qquad\textbf{(E)} ~\displaystyle\frac{1}{22}\qquad$
For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$
[i]Proposed by Shahjalal Shohag, Bangladesh[/i]
Marisa has a collection of $2^8-1=255$ distinct nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8\}$. For each step she takes two subsets chosen uniformly at random from the collection, and replaces them with either their union or their intersection, chosen randomly with equal probability. (The collection is allowed to contain repeated sets.) She repeats this process $2^8-2=254$ times until there is only one set left in the collection. What is the expected size of this set?
Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.
Let $a_1,a_2,\dots,a_n$ be positive real numbers whose product is $1$. Show that the sum \[\textstyle\frac{a_1}{1+a_1}+\frac{a_2}{(1+a_1)(1+a_2)}+\frac{a_3}{(1+a_1)(1+a_2)(1+a_3)}+\cdots+\frac{a_n}{(1+a_1)(1+a_2)\cdots(1+a_n)}\] is greater than or equal to $\frac{2^n-1}{2^n}$.
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way:
\[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \]
Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]
For all $n\ge 1$, let $a_n=\sum_{k=1}^{n-1}\frac{\sin(\frac{(2k-1)\pi}{2n})}{\cos^2(\frac{(k-1)\pi}{2n})\cos^2(\frac{k\pi}{2n})}$. Determine $\lim_{n\rightarrow \infty}\frac{a_n}{n^3}$.
If $x=\frac{1}{3}$, what is the value, rounded to $100$ decimal digits, of $\sum_{n=0}^{7}\frac{2^n}{1+x^{2^n}}$?
[b]p1.[/b] Let $S$ be the sum of the $99$ terms: $$(\sqrt1 + \sqrt2)^{-1},(\sqrt2 + \sqrt3)^{-1}, (\sqrt3 + \sqrt4)^{-1},..., (\sqrt{99} + \sqrt{100})^{-1}.$$ Prove that $S$ is an integer.
[b]p2.[/b] Determine all pairs of positive integers $x$ and $y$ for which $N=x^4+4y^4$ is a prime. (Your work should indicate why no other solutions are possible.)
[b]p3.[/b] Let $w,x,y,z$ be arbitrary positive real numbers. Prove each inequality:
(a) $xy \le \left(\frac{x+y}{2}\right)^2$
(b) $wxyz \le \left(\frac{w+x+y+z}{4}\right)^4$
(c) $xyz \le \left(\frac{x+y+z}{3}\right)^3$
[b]p4.[/b] Twelve points $P_1$,$P_2$, $...$,$P_{12}$ are equally spaaed on a circle, as shown. Prove: that the chords $\overline{P_1P_9}$, $\overline{P_4P_{12}}$ and $\overline{P_2P_{11}}$ have a point in common.
[img]https://cdn.artofproblemsolving.com/attachments/d/4/2eb343fd1f9238ebcc6137f7c84a5f621eb277.png[/img]
[b]p5.[/b] Two very busy men, $A$ and $B$, who wish to confer, agree to appear at a designated place on a certain day, but no earlier than noon and no later than $12:15$ p.m. If necessary, $A$ will wait $6$ minutes for $B$ to arrive, while $B$ will wait $9$ minutes for $A$ to arrive but neither can stay past $12:15$ p.m. Express as a percent their chance of meeting.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from 1 to $10^n$ inclusive. Find the smallest positive integer $n$ for which $S_n$ is an integer.
Let $\mathbb{Z}$ be the set of integers. Determine all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that, for all integers $a$ and $b$, $$f(2a)+2f(b)=f(f(a+b)).$$
[i]Proposed by Liam Baker, South Africa[/i]
Each point in the plane is assigned a real number such that, for any triangle, the number at the center of its inscribed circle is equal to the arithmetic mean of the three numbers at its vertices. Prove that all points in the plane are assigned the same number.
Let $x_1=1/20$, $x_2=1/13$, and \[x_{n+2}=\dfrac{2x_nx_{n+1}(x_n+x_{n+1})}{x_n^2+x_{n+1}^2}\] for all integers $n\geq 1$. Evaluate $\textstyle\sum_{n=1}^\infty(1/(x_n+x_{n+1}))$.
The sum $$\sum_{m=1}^{2023} \frac{2m}{m^4+m^2+1}$$ can be expressed as $\tfrac{a}{b}$ for relatively prime positive integers $a,b.$ Find the remainder when $a+b$ is divided by $1000.$
Each of 2010 boxes in a line contains a single red marble, and for $ 1 \le k \le 2010$, the box in the $ kth$ position also contains $ k$ white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let $ P(n)$ be the probability that Isabella stops after drawing exactly $ n$ marbles. What is the smallest value of $ n$ for which $ P(n) < \frac {1}{2010}$?
$ \textbf{(A)}\ 45 \qquad
\textbf{(B)}\ 63 \qquad
\textbf{(C)}\ 64 \qquad
\textbf{(D)}\ 201 \qquad
\textbf{(E)}\ 1005$
Let $ a(k) $ be the largest odd number by which $ k $ is divisible. Prove that
$$
\sum_{k=1}^{2^n} a(k) = \frac{1}{3}(4^n+2).$$
Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way:
\[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \]
Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]