Found problems: 5802
We have $98$ cards, in each one we will write one of the numbers: $1, 2, 3, 4,...., 97, 98$.
We can order the $98$ cards, in a sequence such that two consecutive numbers $X$ and $Y$ and the number $X - Y$ is greater than $48$, determine how and how many ways we can make this sequence!!
A finite sequence of integers $a_1, a_2, \dots, a_n$ is called [i]regular[/i] if there exists a real number $x$ satisfying \[ \left\lfloor kx \right\rfloor = a_k \quad \text{for } 1 \le k \le n. \] Given a regular sequence $a_1, a_2, \dots, a_n$, for $1 \le k \le n$ we say that the term $a_k$ is [i]forced[/i] if the following condition is satisfied: the sequence \[ a_1, a_2, \dots, a_{k-1}, b \] is regular if and only if $b = a_k$. Find the maximum possible number of forced terms in a regular sequence with $1000$ terms.
Let $f(x) = 3x^2 + 1$. Prove that for any given positive integer $n$, the product
$$f(1)\cdot f(2)\cdot\dots\cdot f(n)$$
has at most $n$ distinct prime divisors.
[i]Proposed by Géza Kós[/i]
Find all bounded sequences $(a_n)_{n=1}^\infty$ of natural numbers such that for all $n \ge 3$, \[ a_n = \frac{a_{n-1} + a_{n-2}}{\gcd(a_{n-1}, a_{n-2})}. \]
Prove or disprove that if a real sequence $(a_n)$ satisfies $a_{n+1}-a_n\to0$ and $a_{2n}-2a_n\to0$ as $n\to\infty$, then $a_n\to0$.
Several non-intersecting diagonals divide a convex polygon into triangles. At each vertex of the polygon the number of triangles adjacent to it is written. Is it possible to reconstruct all the diagonals using these numbers if the diagonals are erased?
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]
Let $h \ge 3$ be an integer and $X$ the set of all positive integers that are greater than or equal to $2h$. Let $S$ be a nonempty subset of $X$ such that the following two conditions hold:
[list]
[*]if $a + b \in S$ with $a \ge h, b \ge h$, then $ab \in S$;
[*]if $ab \in S$ with $a \ge h, b \ge h$, then $a + b \in S$.[/list]
Prove that $S = X$.
A cake has the form of an $ n$ x $ n$ square composed of $ n^{2}$ unit squares. Strawberries lie on some of the unit squares so that each row or column contains exactly one strawberry; call this arrangement $\mathcal{A}$.
Let $\mathcal{B}$ be another such arrangement. Suppose that every grid rectangle with one vertex at the top left corner of the cake contains no fewer strawberries of arrangement $\mathcal{B}$ than of arrangement $\mathcal{A}$. Prove that arrangement $\mathcal{B}$ can be obtained from $ \mathcal{A}$ by performing a number of switches, defined as follows:
A switch consists in selecting a grid rectangle with only two strawberries, situated at its top right corner and bottom left corner, and moving these two strawberries to the other two corners of that rectangle.
Consider the following game for a positive integer $n$. Initially, the numbers $1, 2, \ldots, n$ are written on a board. In each move, two numbers are selected such that their difference is also present on the board. This difference is then erased from the board. (For example, if the numbers $3,6,11$ and $17$ are on the board, then $3$ can be erased as $6 - 3=3$, or $6$ as $17 - 11=6$, or $11$ as $17 - 6=11$.)
For which values of $n$ is it possible to end with only one number remaining on the board?
[i](Michael Reitmeir)[/i]
Let $\alpha, c > 0$, define $x_1 = c$ and let $x_{n + 1} = x_n e^{-x_n^\alpha}$ for $n \geq 1$. For which values of $\beta$ does $\sum_{i = 1}^{\infty} x_n^\beta$ converge?
At a certain orphanage, every pair of orphans are either friends or enemies. For every three of an orphan's friends, an even number of pairs of them are enemies. Prove that it's possible to assign each orphan two parents such that every pair of friends shares exactly one parent, but no pair of enemies does, and no three parents are in a love triangle (where each pair of them has a child).
A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even.
[i]Proposed by Jeck Lim, Singapore[/i]
In a certain sequence of numbers, the first number is $1$, and, for all $n\ge 2$, the product of the first $n$ numbers in the sequence is $n^2$. The sum of the third and the fifth numbers in the sequence is
$\textbf{(A) }\frac{25}{9}\qquad\textbf{(B) }\frac{31}{15}\qquad\textbf{(C) }\frac{61}{16}\qquad\textbf{(D) }\frac{576}{225}\qquad\textbf{(E) }34$
We call a polynomial $P(x)$ good if the numbers $P(k)$ and $P'(k)$ are integers for all integers $k$. Let $P(x)$ be a good polynomial of degree $d$, and let $N_d$ be the product of all composite numbers not exceeding $d$. Prove that the leading coefficient of the polynomial $N_d \cdot P(x)$ is integer.
Let $a>1$ be a positive integer and $f\in \mathbb{Z}[x]$ with positive leading coefficient. Let $S$ be the set of integers $n$ such that
\[n \mid a^{f(n)}-1.\]
Prove that $S$ has density $0$; that is, prove that $\lim_{n\rightarrow \infty} \frac{|S\cap \{1,...,n\}|}{n}=0$.
Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed
Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$;
Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$.
Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins.
[i]Proposed by Hans Zantema, Netherlands[/i]
Let $G$ be a connected (simple) graph with $n$ vertices and at least $n$ edges. Prove that it is possible to color the vertices of $G$ red and blue, so that the following conditions hold:
i. There is at least one vertex of each color,
ii. There is an even number of edges connecting a red vertex to a blue vertex, and
iii. If all such edges are deleted, one is left with two connected graphs.
Let $ n \geq 3 $ be an integer and let
\begin{align*}
x_1,x_2, \ldots, x_n
\end{align*}
be $ n $ distinct integers. Prove that
\begin{align*}
(x_1 - x_2)^2 + (x_2 - x_3)^2 + \ldots + (x_n - x_1)^2 \geq 4n - 6.
\end{align*}
Find all functions $ f: \mathbb{R}\to\mathbb{R}$ such that $ f(x+y)+f(x)f(y)=f(xy)+2xy+1$ for all real numbers $ x$ and $ y$.
[i]Proposed by B.J. Venkatachala, India[/i]
Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$.
[i]Evan O' Dorney.[/i]
There is a large pile of cards. On each card one of the numbers $1$, $2$, $\cdots$, $n$ is written. It is known that the sum of all numbers of all the cards is equal to $k \cdot n!$ for some integer $k$. Prove that it is possible to arrange cards into $k$ stacks so that the sum of numbers written on the cards in each stack is equal to $n!$.
[b]problem 5.[/b]
Let $x_1, x_2,\ldots, x_k$ be vectors of $m$-dimensional Euclidean space, such that $x_1+x_2+\ldots + x_k=0$. Show that there exists a permutation $\pi$ of the integers $\{ 1, 2, \ldots, k \}$ such that:
$$\left\lVert \sum_{i=1}^n x_{\pi (i)}\right\rVert \leq \left( \sum_{i=1}^k \lVert x_i \rVert ^2\right)^{1/2}$$for each $n=1, 2, \ldots, k$. Note that $\lVert \cdot \rVert$ denotes the Euclidean norm.
(18 points).
Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.
We say that a positive integer $n$ is lovely if there exist a positive integer $k$ and (not necessarily distinct) positive integers $d_1$, $d_2$, $\ldots$, $d_k$ such that $n = d_1d_2\cdots d_k$ and $d_i^2 \mid n + d_i$ for $i=1,2,\ldots,k$.
a) Are there infinitely many lovely numbers?
b) Is there a lovely number, greater than $1$, which is a perfect square of an integer?