Found problems: 1340
There are $ n \geq 2$ permutations $ P_1, P_2, \ldots, P_n$ each being an arbitrary permutation of $ \{1,\ldots,n\}.$ Prove that
\[ \sum^{n\minus{}1}_{i\equal{}1} \frac{1}{P_i \plus{} P_{i\plus{}1}} > \frac{n\minus{}1}{n\plus{}2}.\]
Let $m, n > 1$ be coprime odd integers. Show that
$$\big \lfloor \frac{m^{\phi (n)+1} + n^{\phi (m)+1}}{mn} \rfloor$$
is an even integer, where $\phi$ is Euler’s totient function.
Let $P(x)$ be a polynomial with real coefficients. Prove that there exist positive integers $n$ and $k$ such that $k$ has $n$ digits and more than $P(n)$ positive divisors.
Let $n$ be a positive integer. Let $(a, b, c)$ be a random ordered triple of nonnegative integers such that $a + b + c = n$, chosen uniformly at random from among all such triples. Let $M_n$ be the expected value (average value) of the largest of $a$, $b$, and $c$. As $n$ approaches infinity, what value does $\frac{M_n}{n}$ approach?
Let $n$ be an integer greater than 2, and $P_1, P_2, \cdots , P_n$ distinct points in the plane. Let $\mathcal S$ denote the union of all segments $P_1P_2, P_2P_3, \dots , P_{n-1}P_{n}$. Determine if it is always possible to find points $A$ and $B$ in $\mathcal S$ such that $P_1P_n \parallel AB$ (segment $AB$ can lie on line $P_1P_n$) and $P_1P_n = kAB$, where (1) $k = 2.5$; (2) $k = 3$.
One base of a trapezoid is 100 units longer than the other base. The segment that joins the midpoints of the legs divides the trapezoid into two regions whose areas are in the ratio $2: 3.$ Let $x$ be the length of the segment joining the legs of the trapezoid that is parallel to the bases and that divides the trapezoid into two regions of equal area. Find the greatest integer that does not exceed $x^2/100.$
The $n$-element set of real numbers is given, where $n \geq 6$. Prove that there exist at least $n-1$ two-element subsets of this set, in which the arithmetic mean of elements is not less than the arithmetic mean of elements in the whole set.
Two players $A$ and $B$ play the following game taking alternate moves. In each move, a player writes one digit on the blackboard. Each new digit is written either to the right or left of the sequence of digits already written on the blackboard. Suppose that $A$ begins the game and initially the blackboard was empty. $B$ wins the game if ,after some move of $B$, the sequence of digits written in the blackboard represents a perfect square. Prove that $A$ can prevent $B$ from winning.
For each positive integer $n \ge 3$, define $A_n$ and $B_n$ as
\[A_n = \sqrt{n^2 + 1} + \sqrt{n^2 + 3} + \cdots + \sqrt{n^2+2n-1}\]
\[B_n = \sqrt{n^2 + 2} + \sqrt{n^2 + 4} + \cdots + \sqrt{n^2 + 2n}.\]
Determine all positive integers $n\ge 3$ for which $\lfloor A_n \rfloor = \lfloor B_n \rfloor$.
Note. For any real number $x$, $\lfloor x\rfloor$ denotes the largest integer $N\le x$.
[i]Anant Mudgal and Navilarekallu Tejaswi[/i]
For some 2011 natural numbers, all the $\frac{2010\cdot 2011}{2}$ possible sums were written out on a board. Could it have happened that exactly one third of the written numbers were divisible by three and also exactly one third of them give a remainder of one when divided by three?
Let $n$ be an integer with $n\ge 3$. Consider all dissections of a convex $n$-gon into triangles by $n-3$ non-intersecting diagonals, and all colourings of the triangles with black and white so that triangles with a common side are always of a different colour. Find the least possible number of black triangles.
Let $n\geq 2$ be an integer and consider an array composed of $n$ rows and $2n$ columns. Half of the elements in the array are colored in red. Prove that for each integer $k$, $1<k\leq \dsp \left\lfloor \frac n2\right\rfloor+1$, there exist $k$ rows such that the array of size $k\times 2n$ formed with these $k$ rows has at least
\[ \frac { k! (n-2k+2) } {(n-k+1)(n-k+2)\cdots (n-1)} \] columns which contain only red cells.
A function $f: \N\rightarrow\N$ is circular if for every $p\in\N$ there exists $n\in\N,\ n\leq{p}$ such that $f^n(p)=p$ ($f$ composed with itself $n$ times) The function $f$ has repulsion degree $k>0$ if for every $p\in\N$ $f^i(p)\neq{p}$ for every $i=1,2,\dots,\lfloor{kp}\rfloor$. Determine the maximum repulsion degree can have a circular function.
[b]Note:[/b] Here $\lfloor{x}\rfloor$ is the integer part of $x$.
Let $k>1$ be an integer, set $n=2^{k+1}$. Prove that for any positive integers
$a_1<a_2<\cdots<a_n$, the number $\prod_{1\leq i<j\leq n}(a_i+a_j)$ has at least $k+1$ different prime divisors.
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$
Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation
\[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\]
that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$
Prove that for any positive integers $k$ and $N$, \[\left(\frac{1}{N}\sum\limits_{n=1}^{N}(\omega (n))^k\right)^{\frac{1}{k}}\leq k+\sum\limits_{q\leq N}\frac{1}{q},\] where $\sum\limits_{q\leq N}\frac{1}{q}$ is the summation over of prime powers $q\leq N$ (including $q=1$).
Note: For integer $n>1$, $\omega (n)$ denotes number of distinct prime factors of $n$, and $\omega (1)=0$.
Find the integer solutions of the equation
\[ \left[ \sqrt{2m} \right] = \left[ n(2+\sqrt 2) \right] \]
Given an integer $n\ge 4$. $S=\{1,2,\ldots,n\}$. $A,B$ are two subsets of $S$ such that for every pair of $(a,b),a\in A,b\in B, ab+1$ is a perfect square. Prove that
\[\min \{|A|,|B|\}\le\log _2n.\]
The positive function $p(n)$ is defined as the number of ways that the positive integer $n$ can be written as a sum of positive integers. Show that, for all positive integers $n \ge 2$, \[2^{\lfloor \sqrt{n}\rfloor}< p(n) < n^{3 \lfloor\sqrt{n}\rfloor }.\]
Define the functions $f, F : \mathbb N \to \mathbb N$, by
\[f(n)=\left[ \frac{3-\sqrt 5}{2} n \right] , F(k) =\min \{n \in \mathbb N|f^k(n) > 0 \},\]
where $f^k = f \circ \cdots \circ f$ is $f$ iterated $n$ times. Prove that $F(k + 2) = 3F(k + 1) - F(k)$ for all $k \in \mathbb N.$
Find the integer $n \ge 48$ for which the number of trailing zeros in the decimal representation of $n!$ is exactly $n-48$.
[i]Proposed by Kevin Sun[/i]
Purple College keeps a careful count of its students as they progress each year from the freshman class to the sophomore class to the junior class and, finally, to the senior class. Each year at the college one third of the freshman class drops out of school, $40$ students in the sophomore class drop out of school, and one tenth of the junior class drops out of school. Given that the college only admits new freshman students, and that it wants to begin each school year with $3400$ students enrolled, how many students does it need to admit into the freshman class each year?
Let $(a_n)_{n \in \mathbb{N}}$ be a sequence of real numbers such that $$2(a_1+a_2+…+a_n)=na_{n+1}~\forall~n \ge 1.$$
$\textbf{a)}$ Prove that the given sequence is an arithmetic progression.
$\textbf{b)}$ If $\lfloor a_1 \rfloor + \lfloor a_2 \rfloor +…+ \lfloor a_n \rfloor = \lfloor a_1+a_2+…+a_n \rfloor~\forall~ n \in \mathbb{N},$ prove that every term of the sequence is an integer.
For $ s,t \in \mathbb{N}$, consider the set $ M\equal{}\{ (x,y) \in \mathbb{N} ^2 | 1 \le x \le s, 1 \le y \le t \}$. Find the number of rhombi with the vertices in $ M$ and the diagonals parallel to the coordinate axes.