Found problems: 5802
Prove that:
i)
$$\sum_{k=1}^{n-1}(1+\ln k)\le n^2-n+1$$
ii)
$$\sum_{k=1}^{n-1}\sqrt{\ln k}\le\frac{n^2-n+1}2$$
[i]Proposed by Laurențiu Modan[/i]
Let $f : \mathbb Q \to \mathbb Q$ be a function such that for any $x,y \in \mathbb Q$, the number $f(x+y)-f(x)-f(y)$ is an integer. Decide whether it follows that there exists a constant $c$ such that $f(x) - cx$ is an integer for every rational number $x$.
[i]Proposed by Victor Wang[/i]
Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$,
\[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]
Call a rational number [i]short[/i] if it has finitely many digits in its decimal expansion. For a positive integer $m$, we say that a positive integer $t$ is $m-$[i]tastic[/i] if there exists a number $c\in \{1,2,3,\ldots ,2017\}$ such that $\dfrac{10^t-1}{c\cdot m}$ is short, and such that $\dfrac{10^k-1}{c\cdot m}$ is not short for any $1\le k<t$. Let $S(m)$ be the set of $m-$tastic numbers. Consider $S(m)$ for $m=1,2,\ldots{}.$ What is the maximum number of elements in $S(m)$?
We say a finite set $S$ of points in the plane is [i]very[/i] if for every point $X$ in $S$, there exists an inversion with center $X$ mapping every point in $S$ other than $X$ to another point in $S$ (possibly the same point).
(a) Fix an integer $n$. Prove that if $n \ge 2$, then any line segment $\overline{AB}$ contains a unique very set $S$ of size $n$ such that $A, B \in S$.
(b) Find the largest possible size of a very set not contained in any line.
(Here, an [i]inversion[/i] with center $O$ and radius $r$ sends every point $P$ other than $O$ to the point $P'$ along ray $OP$ such that $OP\cdot OP' = r^2$.)
[i]Proposed by Sammy Luo[/i]
Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions:
(i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$;
(ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$.
Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list]
[i]Proposed by Hans Zantema, Netherlands[/i]
A nonempty set $S$ is called $\emph{well-filled}$ if for every $m \in S$, there are fewer than $\frac 12 m$ elements of $S$ which are less than $m$.
Determine the number of well-filled subsets of $\left\{ 1,2,\dots,42 \right\}$.
There are $ n\geq 5$ people in a party. Assume that among any three of them some two know each other. Show that one can select at least $ \frac{n}{2}$ people and arrange them at a round table so that each person sits between two of his/her acquaintances.
Let $N$ be a positive integer. Alberto and Barbara write numbers on a blackboard taking turns, according to the following rules. Alberto starts writing $1$, and thereafter if a player has written $n$ on a certain move, his adversary is allowed to write $n+1$ or $2n$ as long as he/she does not obtain a number greater than $N$. The player who writes $N$ wins.
$(a)$ Determine which player has a winning strategy for $N=2005$.
$(b)$ Determine which player has a winning strategy for $N=2004$.
$(c)$ Find for how many integers $N\le 2005$ Barbara has a winning strategy.
Let $n\geq 2$ be an integer, and let $0 < a_1 < a_2 < \cdots < a_{2n+1}$ be real numbers. Prove the inequality
\[ \sqrt[n]{a_1} - \sqrt[n]{a_2} + \sqrt[n]{a_3} - \cdots + \sqrt[n]{a_{2n+1}} < \sqrt[n]{a_1 - a_2 + a_3 - \cdots + a_{2n+1}}. \]
[i]Bogdan Enescu, Romania[/i]
Find all function $f:\mathbb{N} \longrightarrow \mathbb{N}$ such that
forall positive integers $x$ and $y$, $\frac{f(x+y)-f(x)}{f(y)}$ is again a positive integer not exceeding $2022^{2022}$.
Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?
$\mathcal{P}(\mathbb{n})$ denotes the collection of all subsets of $\mathbb{N}$. Let $f:\mathbb{N} \longrightarrow \mathcal{P}(\mathbb{n})$ be a function such that $$f(n) = \bigcup_{d|n,d<n,n \geq 2} f(d)$$ Find the number of such functions $f$ for which the range of $f \subseteq$ {$1,2,3....2024$}.
Consider an $m$-by-$n$ grid of unit squares, indexed by $(i, j)$ with $1 \leq i \leq m$ and $1 \leq j \leq n$. There are $(m-1)(n-1)$ coins, which are initially placed in the squares $(i, j)$ with $1 \leq i \leq m-1$ and $1 \leq j \leq n-1$. If a coin occupies the square $(i, j)$ with $i \leq m-1$ and $j \leq n-1$ and the squares $(i+1, j),(i, j+1)$, and $(i+1, j+1)$ are unoccupied, then a legal move is to slide the coin from $(i, j)$ to $(i+1, j+1)$. How many distinct configurations of coins can be reached starting from the initial configuration by a (possibly empty) sequence of legal moves?
Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\]
Define the set $A$ by
\[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]
Prove that, if $A$ is not empty, then
\[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]
Determine all non-constant monic polynomials $f(x)$ with integer coefficients for which there exists a natural number $M$ such that for all $n \geq M$, $f(n)$ divides $f(2^n) - 2^{f(n)}$
[i] Proposed by Anant Mudgal [/i]
Let $n$ be a positive integer and let $T$ denote the collection of points $(x_1, x_2, \ldots, x_n) \in \mathbb R^n$ for which there exists a permutation $\sigma$ of $1, 2, \ldots , n$ such that $x_{\sigma(i)} - x_{\sigma(i+1) } \geq 1$ for each $i=1, 2, \ldots , n.$ Prove that there is a real number $d$ satisfying the following condition:
For every $(a_1, a_2, \ldots, a_n) \in \mathbb R^n$ there exist points $(b_1, \ldots, b_n)$ and $(c_1,\ldots, c_n)$ in $T$ such that, for each $i = 1, . . . , n,$
\[a_i=\frac 12 (b_i+c_i) , \quad |a_i - b_i| \leq d, \quad \text{and} \quad |a_i - c_i| \leq d.\]
Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ .
[i]Proposed by Serbia[/i]
Alice the architect and Bob the builder play a game. First, Alice chooses two points $P$ and $Q$ in the plane and a subset $\mathcal{S}$ of the plane, which are announced to Bob. Next, Bob marks infinitely many points in the plane, designating each a city. He may not place two cities within distance at most one unit of each other, and no three cities he places may be collinear. Finally, roads are constructed between the cities as follows: for each pair $A,\,B$ of cities, they are connected with a road along the line segment $AB$ if and only if the following condition holds:
[center]For every city $C$ distinct from $A$ and $B$, there exists $R\in\mathcal{S}$ such[/center]
[center]that $\triangle PQR$ is directly similar to either $\triangle ABC$ or $\triangle BAC$.[/center]
Alice wins the game if (i) the resulting roads allow for travel between any pair of cities via a finite sequence of roads and (ii) no two roads cross. Otherwise, Bob wins. Determine, with proof, which player has a winning strategy.
[i]Note:[/i] $\triangle UVW$ is [i]directly similar[/i] to $\triangle XYZ$ if there exists a sequence of rotations, translations, and dilations sending $U$ to $X$, $V$ to $Y$, and $W$ to $Z$.
Into how many regions do $n$ great circles, no three of which meet at a point, divide a sphere?
Initially, a pair of numbers $(1,1)$ is written on the board. If for some $x$ and $y$ one of the pairs $(x, y-1)$ and $(x+y, y+1)$ is written on the board, then you can add the other one. Similarly for $(x, xy)$ and $(\frac {1} {x}, y)$. Prove that for each pair that appears on the board, its first number will be positive.
Let $\, a,b \,$ be odd positive integers. Define the sequence $\, (f_n ) \,$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for $\, n \,$ sufficiently large and determine the eventual value as a function of $\, a \,$ and $\, b$.
Does there exist a strictly increasing infinite sequence of perfect squares $a_1, a_2, a_3, ...$ such that for all $k\in \mathbb{Z}^+$ we have that $13^k | a_k+1$?
[i]Proposed by Jesse Zhang[/i]
Find all pairs of positive integers $\left(n;\;k\right)$ such that $n!=\left( n+1\right)^{k}-1$.
Find all strictly increasing sequences of positive integers $a_1, a_2, \ldots$ with $a_1=1$, satisfying $$3(a_1+a_2+\ldots+a_n)=a_{n+1}+\ldots+a_{2n}$$ for all positive integers $n$.