Found problems: 5802
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both
$$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$
are integers.
Let $r, s \geq 1$ be integers and $a_{0}, a_{1}, . . . , a_{r-1}, b_{0}, b_{1}, . . . , b_{s-1} $ be real non-negative numbers such that $(a_0+a_1x+a_2x^2+. . .+a_{r-1}x^{r-1}+x^r)(b_0+b_1x+b_2x^2+. . .+b_{s-1}x^{s-1}+x^s) =1 +x+x^2+. . .+x^{r+s-1}+x^{r+s}$.
Prove that each $a_i$ and each $b_j$ equals either $0$ or $1$.
Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform [i]stone moves[/i], defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$, such that $i<j$ and $k<l$. A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively, or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively.
Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.
How many different non-equivalent ways can Steve pile the stones on the grid?
Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
$P(x,y)$ is polynomial with real coefficients and $P(x+2y,x+y)=P(x,y)$. Prove that exists polynomial $Q(t)$ such that $P(x,y)=Q((x^2-2y^2)^2)$
[i]A. Golovanov[/i]
Let $f(x)=x^{2002}-x^{2001}+1$. Prove that for every positive integer $m$, the numbers $m,f(m),f(f(m)),\ldots$ are pairwise coprime.
Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses.
An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise.
Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.
Let $S$ be the set of all rational numbers expressible in the form \[\frac{(a_1^2+a_1-1)(a_2^2+a_2-1)\ldots (a_n^2+a_n-1)}{(b_1^2+b_1-1)(b_2^2+b_2-1)\ldots (b_n^2+b_n-1)}\] for some positive integers $n, a_1, a_2 ,\ldots, a_n, b_1, b_2, \ldots, b_n$. Prove that there is an infinite number of primes in $S$.
Determine all ordered pairs $(a,p)$ of positive integers, with $p$ prime, such that $p^a+a^4$ is a perfect square.
[i]Proposed by Tahjib Hossain Khan, Bangladesh[/i]
A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$, there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$. (The elements $s$ and $t$ could be equal.)
Given this information, find all possible values for the number of elements of $S$.
Let $a>0$, $S_1 =\ln a$ and $S_n = \sum_{i=1 }^{n-1} \ln( a- S_i )$ for $n >1.$ Show that
$$ \lim_{n \to \infty} S_n = a-1.$$
Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that whenever $a>b>c>d>0$ and $ad=bc$,
\[f(a+d)+f(b-c)=f(a-d)+f(b+c).\]
[i]Calvin Deng.[/i]
Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Let $n$ and $t$ be positive integers. What is the number of ways to place $t$ dominoes $(1\times 2$ or $2\times 1$ rectangles) in a $2\times n$ table so that there is no $2\times 2$ square formed by $2$ dominoes and each $2\times 3$ rectangle either does not have a horizontal domino in the middle and last cell in the first row or does not have a horizontal domino in the first and middle cell in the second row (or both)?
A $(2^n - 1) \times (2^n +1)$ board is to be divided into rectangles with sides parallel to the sides of the board and integer side lengths such that the area of each rectangle is a power of 2. Find the minimum number of rectangles that the board may be divided into.
Let $P$ be a regular $99$-gon. Assign integers between $1$ and $99$ to the vertices of $P$ such that each integer appears exactly once. (If two assignments coincide under rotation, treat them as the same. ) An [i]operation[/i] is a swap of the integers assigned to a pair of adjacent vertices of $P$. Find the smallest integer $n$ such that one can achieve every other assignment from a given one with no more than $n$ operations.
[i]Proposed by Zhenhua Qu[/i]
Prove that any natural number smaller or equal than the factorial of a natural number $ n $ is the sum of at most $ n $ distinct divisors of the factorial of $ n. $
An infinite arithmetic progression whose terms are positive integers contains the square of an integer and the cube of an integer. Show that it contains the sixth power of an integer.
Define a function $f: \mathbb N \to \mathbb N$ by $f(1) = 1$, $f(n+1) = f(n) + 2^{f(n)}$ for every positive integer $n$. Prove that $f(1), f(2), \dots, f(3^{2013})$ leave distinct remainders when divided by $3^{2013}$.
For which maximal $N$ there exists an $N$-digit number with the following property: among any sequence of its consecutive decimal digits some digit is present once only?
Alexey Glebov
The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game?
[i]Brian Hamrick.[/i]
We visit all squares exactly once on a $n\times n$ chessboard (colored in the usual way) with a king. Find the smallest number of times we had to switch colors during our walk.
[i]Proposed by Dömötör Pálvölgyi, Budapest[/i]
$2024$ otters live in the river. Some are friends with each other. Is it possible that, for any collection of $1012$ otters, there is exactly one additional otter that is friends with all $1012$ otters?
A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence.
Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.