Found problems: 5802
Solve in prime numbers $ 2p^q \minus{} q^p \equal{} 7$.
Given positive integers $m$ and $n \ge m$, determine the largest number of dominoes ($1\times2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2n$ columns consisting of cells ($1 \times 1$
squares) so that:
(i) each domino covers exactly two adjacent cells of the board;
(ii) no two dominoes overlap;
(iii) no two form a $2 \times 2$ square; and
(iv) the bottom row of the board is completely covered by $n$ dominoes.
Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the
sequence $1$, $2$, $\dots$ , $n$ satisfying
$$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$.
Proposed by United Kingdom
Let $n$ be a positive integer. $n$ people take part in a certain party. For any pair of the participants, either the two are acquainted with each other or they are not. What is the maximum possible number of the pairs for which the two are not acquainted but have a common acquaintance among the participants?
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties:
[list=disc]
[*]every term in the sequence is less than or equal to $2^{2023}$, and
[*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\]
[/list]
Prove that for every integer power of 2, there exists a multiple of it with all digits (in decimal expression) not zero.
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 $\mathbb N$ be the set of positive integers. Find all functions $f\colon\mathbb N\to\mathbb N$ such that $$\frac{f(x)-f(y)+x+y}{x-y+1}$$ is an integer, for all positive integers $x,y$ with $x>y$.
In the space are given $2006$ distinct points, such that no $4$ of them are coplanar. One draws a segment between each pair of points.
A natural number $m$ is called [i]good[/i] if one can put on each of these segments a positive integer not larger than $m$, so that every triangle whose three vertices are among the given points has the property that two of this triangle's sides have equal numbers put on, while the third has a larger number put on.
Find the minimum value of a [i]good[/i] number $m$.
Let $n\ge 3$ be an integer and $a_1,a_2,\dots ,a_n$ be a finite sequence of positive integers, such that, for $k=2,3,\dots ,n$ $$n(a_k+1)-(n-1)a_{k-1}=1.$$ Prove that $a_n$ is not divisible by $(n-1)^2$.
For every integer $ k \geq 2,$ prove that $ 2^{3k}$ divides the number
\[ \binom{2^{k \plus{} 1}}{2^{k}} \minus{} \binom{2^{k}}{2^{k \minus{} 1}}
\]
but $ 2^{3k \plus{} 1}$ does not.
[i]Author: Waldemar Pompe, Poland[/i]
From a collection of $n$ persons $q$ distinct two-member teams are selected and ranked $1, \cdots, q$ (no ties). Let $m$ be the least integer larger than or equal to $2q/n$. Show that there are $m$ distinct teams that may be listed so that :
[b](i)[/b] each pair of consecutive teams on the list have one member in common and
[b](ii)[/b] the chain of teams on the list are in rank order.
[i]Alternative formulation.[/i]
Given a graph with $n$ vertices and $q$ edges numbered $1, \cdots , q$, show that there exists a chain of $m$ edges, $m \geq \frac{2q}{n}$ , each two consecutive edges having a common vertex, arranged monotonically with respect to the numbering.
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.\]
Let integer $n\ge 3,$ $\tbinom n2$ nonnegative real numbers $a_{i,j}$ satisfy $ a_{i,j}+a_{j,k}\le a_{i,k}$ holds for all $1\le i <j<k\le n$. Proof
$$\left\lfloor\frac{n^2}4\right\rfloor\sum_{1\le i<j\le n}a_{i,j}^4\ge \left(\sum_{1\le i<j\le n}a_{i,j}^2\right)^2.$$
[i]Proposed by Jingjun Han, Dongyi Wei[/i]
Let $a, b, c$ be positive real numbers such that $a + b + c = 1$. If $n$ is a positive integer then prove that
\[ \frac{(3a)^n}{(b + 1)(c + 1)} + \frac{(3b)^n}{(c + 1)(a + 1)} + \frac{(3c)^n}{(a + 1)(b + 1)} \ge \frac{27}{16} \,. \]
Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.
For positive integers $n, k, l$, we define the number of $l$-tuples of positive integers $(a_1,a_2,\cdots a_l)$ satisfying the following as $Q(n,k,l)$.
(i): $n=a_1+a_2+\cdots +a_l$
(ii): $a_1>a_2>\cdots > a_l > 0$.
(iii): $a_l$ is an odd number.
(iv): There are $k$ odd numbers out of $a_i$.
For example, from $9=8+1=6+3=6+2+1$, we have $Q(9,1,1)=1$, $Q(9,1,2)=2$, $Q(9,1,3)=1$.
Prove that if $n>k^2$, $\sum_{l=1}^n Q(n,k,l)$ is $0$ or an even number.
Let $a$ and $b$ be real numbers with $a<b,$ and let $f$ and $g$ be continuous functions from $[a,b]$ to $(0,\infty)$ such that $\int_a^b f(x)\,dx=\int_a^b g(x)\,dx$ but $f\ne g.$ For every positive integer $n,$ define
\[I_n=\int_a^b\frac{(f(x))^{n+1}}{(g(x))^n}\,dx.\]
Show that $I_1,I_2,I_3,\dots$ is an increasing sequence with $\displaystyle\lim_{n\to\infty}I_n=\infty.$
Let $S$ be a finite set and $P$ the set of all subsets of $S$. Show that one can label the elements of $P$ as $A_i$ such that
(1) $A_1 =\emptyset$.
(2) For each $n\geq1 $ we either have $A_{n-1}\subset A_{n}$ and $|A_{n} \setminus A_{n-1}|=1$ or $A_{n}\subset A_{n-1}$ and $|A_{n-1} \setminus A_{n}|=1.$
Let's say we have a [i]nice[/i] representation of the positive integer $ n$ if we write it as a sum of powers of 2 in such a way that there are at most two equal powers in the sum (representations differing only in the order of their summands are considered to be the same).
a) Write down the 5 nice representations of 10.
b) Find all positive integers with an even number of nice representations.
There are $64$ towns in a country and some pairs of towns are connected by roads but we do not know these pairs. We may choose any pair of towns and find out whether they are connected or not. Our aim is to determine whether it is possible to travel from any town to any other by a sequence of roads. Prove that there is no algorithm which enables us to do so in less than $2016$ questions.
(Proposed by Konstantin Knop)
For how many integers $n$ between $ 1$ and $2021$ does the infinite nested expression $$\sqrt{n + \sqrt{n +\sqrt{n + \sqrt{...}}}}$$ give a rational number?
Find all functions $f\colon \mathbb{R}\to \mathbb{R}$ such that
\[f(xf(y)+f(x)) = 2f(x)+xy\]
for every reals $x,y$.
Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths.
(Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.)
[i]Fedor Petrov, Russia[/i]
Two players $A$ and $B$ play alternatively in a convex polygon with $n \geq 5$ sides. In each turn, the corresponding player has to draw a diagonal that does not cut inside the polygon previously drawn diagonals. A player loses if after his turn, one quadrilateral is formed such that its two diagonals are not drawn. $A$ starts the game.
For each positive integer $n$, find a winning strategy for one of the players.