Found problems: 1782
Suppose a function $f : \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ satisfies $f(f(n)) + f(n+1) = n+2$ for all positive integer $n$. Prove that $f(f(n)+n) = n+1$ for all positive integer $n$.
Find the largest prime that divides $1\cdot 2\cdot 3+2\cdot 3\cdot 4+\cdots +44\cdot 45\cdot 46$
Find all functions $f:\mathbb{Z}\to \mathbb{Z}$ satisfying the condition $f(n)-f(n+f(m))=m$ for all $m,n\in \mathbb{Z}$
Let $a_0,b_0$ be positive integers, and define $a_{i+1}=a_i+\lfloor\sqrt{b_i}\rfloor$ and $b_{i+1}=b_i+\lfloor\sqrt{a_i}\rfloor$ for all $i\ge0$. Show that there exists a positive integer $n$ such that $a_n=b_n$.
[i]David Yang.[/i]
Consider the set $E = \{1,2,\ldots,2n\}$. Prove that an element $c \in E$ can belong to a subset $A \subset E$, having $n$ elements, and such that any two distinct elements in $A$ do not divide one each other, if and only if \[c > n \left( \frac{2}{3}\right )^{k+1},\] where $k$ is the exponent of $2$ in the factoring of $c$.
Let $a,b,c\ge0$. Show that $(a^2+2bc)^{2012}+(b^2+2ca)^{2012}+(c^2+2ab)^{2012}\le (a^2+b^2+c^2)^{2012}+2(ab+bc+ca)^{2012}$.
[i]Calvin Deng.[/i]
Let $n\ge 2$ be a given integer. Show that the number of strings of length $n$ consisting of $0'$s and $1'$s such that there are equal number of $00$ and $11$ blocks in each string is equal to
\[2\binom{n-2}{\left \lfloor \frac{n-2}{2}\right \rfloor}\]
In how many ways can the set of integers $\{1,2,\ldots ,1995\}$ be partitioned into three non-empty sets so that none of these sets contains any pair of consecutive integers?
Evaluate $ \int_0^1 (1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{n \minus{} 1})\{1 \plus{} 3x \plus{} 5x^2 \plus{} \cdots \plus{} (2n \minus{} 3)x^{n \minus{} 2} \plus{} (2n \minus{} 1)x^{n \minus{} 1}\}\ dx.$
A partition of a set \( A \) is a family of non-empty subsets of \( A \), such that any two distinct subsets in the family are disjoint, and the union of all subsets equals \( A \). We say that a partition of a set of integers \( B \) is [i]separated[/i] if each subset in the partition does [b]not[/b] contain consecutive integers. Prove that, for every positive integer \( n \), the number of partitions of the set \( \{1, 2, \dots, n\} \) is equal to the number of separated partitions of the set \( \{1, 2, \dots, n+1\} \).
For example, \( \{\{1,3\}, \{2\}\} \) is a separated partition of the set \( \{1,2,3\} \). On the other hand, \( \{\{1,2\}, \{3\}\} \) is a partition of the same set, but it is not separated since \( \{1,2\} \) contains consecutive integers.
Let $ G$ be a simple graph with $ 2 \cdot n$ vertices and $ n^{2}+1$ edges. Show that this graph $ G$ contains a $ K_{4}-\text{one edge}$, that is, two triangles with a common edge.
$ 2^n $ coins are given to a couple of kids. Interchange of the coins occurs when some of the kids has at least half of all the coins. Then from the coins of one of those kids to the all other kids are given that much coins as the kid already had. In case when all the coins are at one kid there is no possibility for interchange. What is the greatest possible number of consecutive interchanges? ($ n $ is natural number)
Lisa and Bart are playing a game. A round table has $n$ lights evenly spaced around its circumference. Some of the lights are on and some of them off; the initial configuration is random. Lisa wins if she can get all of the lights turned on; Bart wins if he can prevent this from happening.
On each turn, Lisa chooses the positions at which to flip the lights, but before the lights are flipped, Bart, knowing Lisa’s choices, can rotate the table to any position that he chooses (or he can leave the table as is). Then the lights in the positions that Lisa chose are flipped: those that are off are turned on and those that are on are turned off.
Here is an example turn for $n = 5$ (a white circle indicates a light that is on, and a black
circle indicates a light that is off):
[asy]
size(250); defaultpen(linewidth(1)); picture p = new picture;
real r = 0.2; pair s1=(0,-4), s2=(0,-8); int[][] filled = {{1,2,3},{1,2,5},{2,3,4,5}};
draw(p,circle((0,0),1));
for(int i = 0; i < 5; ++i) {
pair P = dir(90-72*i); filldraw(p,circle(P,r),white); label(p,string(i+1),P,2*P,fontsize(10));
}
add(p); add(shift(s1)*p); add(shift(s2)*p);
for(int j = 0; j < 3; ++j)
for(int i = 0; i < filled[j].length; ++i)
filldraw(circle(dir(90-72*(filled[j][i]-1))+j*s1,r));
label("$\parbox{15em}{Initial Position.}$", (-4.5,0));
label("$\parbox{15em}{Lisa says ``1,3,4.'' \\ Bart rotates the table one \\ position counterclockwise. }$", (-4.5,0)+s1);
label("$\parbox{15em}{Lights in positions 1,3,4 are \\ flipped.}$", (-4.5,0)+s2);[/asy]
Lisa can take as many turns as she needs to win, or she can give up if it becomes clear
to her that Bart can prevent her from winning.
(a) Show that if $n = 7$ and initially at least one light is on and at least one light is off,
then Bart can always prevent Lisa from winning.
(b) Show that if $n = 8$, then Lisa can always win in at most 8 turns.
Let $(a_n)_{n \geq 0}$ be the sequence of integers defined recursively by $a_0 = 0, a_1 = 1, a_{n+2} = 4a_{n+1} + a_n$ for $n \geq 0.$ Find the common divisors of $a_{1986}$ and $a_{6891}.$
Let $f$ be the function of the set of positive integers into itself, defi ned by $f(1) = 1$,
$f(2n) = f(n)$ and $f(2n + 1) = f(n) + f(n + 1)$. Show that, for any positive integer $n$, the
number of positive odd integers m such that $f(m) = n$ is equal to the number of positive
integers[color=#0000FF][b] less or equal to [/b][/color]$n$ and coprime to $n$.
[color=#FF0000][mod: the initial statement said less than $n$, which is wrong.][/color]
Determine all positive integers $n$, $n\ge2$, such that the following statement is true:
If $(a_1,a_2,...,a_n)$ is a sequence of positive integers with $a_1+a_2+\cdots+a_n=2n-1$, then there is block of (at least two) consecutive terms in the sequence with their (arithmetic) mean being an integer.
Two people, $A$ and $B$, play the following game with a deck of 32 cards. With $A$ starting, and thereafter the players alternating, each player takes either 1 card or a prime number of cards. Eventually all of the cards are chosen, and the person who has none to pick up is the loser. Who will win the game if they both follow optimal strategy?
Suppose we have a simple polygon (that is it does not intersect itself, but not necessarily convex).
Show that this polygon has a diameter which is completely inside the polygon and the two arcs it creates on the polygon perimeter (the two arcs have 2 vertices in common) both have at least one third of the vertices of the polygon.
Let $\mathbb{R}^{+}$ denote the set of all positive real numbers. Find all functions $f:\mathbb{R}^{+}\longrightarrow \mathbb{R}$ satisfying
\[f(x)+f(y)\le \frac{f(x+y)}{2}, \frac{f(x)}{x}+\frac{f(y)}{y}\ge \frac{f(x+y)}{x+y},\]
for all $x, y\in \mathbb{R}^{+}$.
Given a circle and $2006$ points lying on this circle. Albatross colors these $2006$ points in $17$ colors. After that, Frankinfueter joins some of the points by chords such that the endpoints of each chord have the same color and two different chords have no common points (not even a common endpoint). Hereby, Frankinfueter intends to draw as many chords as possible, while Albatross is trying to hinder him as much as he can. What is the maximal number of chords Frankinfueter will always be able to draw?
The sequence $\{a_{n}\}_{n \ge 1}$ is defined by $a_{1}=1$ and \[a_{n+1}= \frac{a_{n}}{2}+\frac{1}{4a_{n}}\; (n \in \mathbb{N}).\] Prove that $\sqrt{\frac{2}{2a_{n}^{2}-1}}$ is a positive integer for $n>1$.
A function $f(\theta)$ satisfies the following conditions $(a),(b)$.
$(a)\ f(\theta)\geq 0$
$(b)\ \int_0^{\pi} f(\theta)\sin \theta d\theta =1$
Prove the following inequality.
\[\int_0^{\pi} f(\theta)\sin n\theta \ d\theta \leq n\ (n=1,2,\cdots)\]
Let $n>1$ be an integer and $a,b,c$ be three complex numbers such that $a+b+c=0$ and $a^n+b^n+c^n=0$. Prove that two of $a,b,c$ have the same magnitude.
[i]Evan O'Dorney.[/i]
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.