Found problems: 1340
If $n>4$ is a composite number, then $2n$ divides $(n-1)!$.
A transformation of the first quadrant of the coordinate plane maps each point $(x,y)$ to the point $(\sqrt{x},\sqrt{y}).$ The vertices of quadrilateral $ABCD$ are $A=(900,300), B=(1800,600), C=(600,1800),$ and $D=(300,900).$ Let $k$ be the area of the region enclosed by the image of quadrilateral $ABCD.$ Find the greatest integer that does not exceed $k.$
Let $ \alpha$ be the positive root of the equation $ x^{2} \equal{} 1991x \plus{} 1$. For natural numbers $ m$ and $ n$ define
\[ m*n \equal{} mn \plus{} \lfloor\alpha m \rfloor \lfloor \alpha n\rfloor.
\]
Prove that for all natural numbers $ p$, $ q$, and $ r$,
\[ (p*q)*r \equal{} p*(q*r).
\]
Find the minimum number of colors necessary to color the integers from $1$ to $2007$ such that if distinct integers $a$, $b$, and $c$ are the same color, then $a \nmid b$ or $b \nmid c$.
Let $n \ge 2$ be an integer. Find all real numbers $a$ such that there exist real numbers $x_1,x_2,\dots,x_n$ satisfying
\[x_1(1-x_2)=x_2(1-x_3)=\dots=x_n(1-x_1)=a.\]
[i]Proposed by Walther Janous and Gerhard Kirchner, Innsbruck.[/i]
Let $S$ be the set of all squarefree numbers and $n$ be a natural number. Prove that
$$\sum_{k\in S}\left\lfloor\sqrt{\frac nk}\right\rfloor=n.$$
1) Cells of $8 \times 8$ table contain pairwise distinct positive integers. Each integer is prime or a product of two primes. It is known that for any integer $a$ from the table there exists integer written in the same row or in the same column such that it is not relatively prime with $a$. Find maximum possible number of prime integers in the table.
2) Cells of $2n \times 2n$ table, $n \ge 2,$ contain pairwise distinct positive integers. Each integer is prime or a product of two primes. It is known that for any integer $a$ from the table there exist integers written in the same row and in the same column such that they are not relatively prime with $a$. Find maximum possible number of prime integers in the table.
Let $\displaystyle{p,q}$ be relatively prime positive integers. Prove that
\[\displaystyle{ \sum_{k=0}^{pq-1} (-1)^{\left\lfloor \frac{k}{p}\right\rfloor + \left\lfloor \frac{k}{q}\right\rfloor} = \begin{cases} 0 & \textnormal{ if } pq \textnormal{ is even}\\ 1 & \textnormal{if } pq \textnormal{ odd}\end{cases}}\]
[i]Proposed by Alexander Bolbot, State University, Novosibirsk.[/i]
A tournament is held among $n$ teams, following such rules:
a) every team plays all others once at home and once away.(i.e. double round-robin schedule)
b) each team may participate in several away games in a week(from Sunday to Saturday).
c) there is no away game arrangement for a team, if it has a home game in the same week.
If the tournament finishes in 4 weeks, determine the maximum value of $n$.
Prove that $ \forall n\in\mathbb{N}$,$ \exists a,b,c\in$$\bigcup_{k\in\mathbb{N}}(k^{2},k^{2}+k+3\sqrt 3) $ such that $n=\frac{ab}{c}$.
Two sequences $(x_n)_{n\in N}$ and $(y_n)_{n\in N}$ are defined recursively as follows:
$x_0 = 2015$ and $x_{n+1} =\left \lfloor x_n \cdot \frac{y_{n+1}}{y_{n-1}} \right \rfloor$ for all $n \ge 0$,
$y_0 = 307$ and $y_{n+1} = y_n + 1$ for all $n \ge 0$.
Compute $\lim_{n\to \infty} \frac{x_n}{(y_n)^2}$.
Find the largest integer $N$ satisfying the following two conditions:
[b](i)[/b] $\left[ \frac N3 \right]$ consists of three equal digits;
[b](ii)[/b] $\left[ \frac N3 \right] = 1 + 2 + 3 +\cdots + n$ for some positive integer $n.$
Find the integer represented by $\left[ \sum_{n=1}^{10^9} n^{-2/3} \right] $. Here $[x]$ denotes the greatest integer less than or equal to $x.$
Prove that for any positive real number $\alpha$, the number $\lfloor\alpha n^2\rfloor$ is even for infinitely many positive integers $n$.
For any real $ x$, let $ \lfloor x\rfloor$ be the largest integer that is not more than $ x$. Given a sequence of positive integers $ a_1,a_2,a_3,\ldots$ such that $ a_1>1$ and
\[ \left\lfloor\frac{a_1\plus{}1}{a_2}\right\rfloor\equal{}\left\lfloor\frac{a_2\plus{}1}{a_3}\right\rfloor\equal{}\left\lfloor\frac{a_3\plus{}1}{a_4}\right\rfloor\equal{}\cdots\]
Prove that
\[ \left\lfloor\frac{a_n\plus{}1}{a_{n\plus{}1}}\right\rfloor\leq1\]
holds for every positive integer $ n$.
For how many positive integers $n \le 1000$ does the equation in real numbers $x^{\lfloor x \rfloor } = n$ have a positive solution for $x$?
Define the sequence $a_1, a_2, a_3, \ldots$ by $a_1 = 1$ and, for $n > 1$,
\[a_n = a_{\lfloor n/2 \rfloor} + a_{\lfloor n/3 \rfloor} + \ldots + a_{\lfloor n/n \rfloor} + 1.\]
Prove that there are infinitely many $n$ such that $a_n \equiv n \pmod{2^{2010}}$.
Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years.
(a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end.
(b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor
+ \left\lfloor \frac{4r}{r+b} \right\rfloor
+ ...
+ \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor
. \]
[i]Proposed by Sammy Luo[/i]
[b]Problem 3.[/b] Let $n\geq 3$ is given natural number, and $M$ is the set of the first $n$ primes. For any nonempty subset $X$ of $M$ with $P(X)$ denote the product of its elements. Let $N$ be a set of the kind $\ds\frac{P(A)}{P(B)}$, $A\subset M, B\subset M, A\cap B=\emptyset$ such that the product of any 7 elements of $N$ is integer. What is the maximal number of elements of $N$?
[i]Alexandar Ivanov[/i]
Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.
Show that for all prime numbers $p$, \[Q(p)=\prod^{p-1}_{k=1}k^{2k-p-1}\] is an integer.
Do there exist irrational numbers $a, b>1$ and $\lfloor a^{m}\rfloor \not=\lfloor b^{n}\rfloor $ for any positive integers $m$ and $n$?
Denote by $x_n(p)$ the multiplicity of the prime $p$ in the canonical representation of the number $n!$ as a product of primes. Prove that $\frac{x_n(p)}{n}<\frac{1}{p-1}$ and $\lim_{n \to \infty}\frac{x_n(p)}{n}=\frac{1}{p-1}$.
Let $x$ be a real number selected uniformly at random between 100 and 200. If $\lfloor {\sqrt{x}} \rfloor = 12$, find the probability that $\lfloor {\sqrt{100x}} \rfloor = 120$. ($\lfloor {v} \rfloor$ means the greatest integer less than or equal to $v$.)
$\text{(A)} \ \frac{2}{25} \qquad \text{(B)} \ \frac{241}{2500} \qquad \text{(C)} \ \frac{1}{10} \qquad \text{(D)} \ \frac{96}{625} \qquad \text{(E)} \ 1$
Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.