Found problems: 5802
In right triangle $ ABC$ with right angle at $ C$, $ \angle BAC < 45$ degrees and $ AB \equal{} 4$. Point $ P$ on $ AB$ is chosen such that $ \angle APC \equal{} 2\angle ACP$ and $ CP \equal{} 1$. The ratio $ \frac{AP}{BP}$ can be represented in the form $ p \plus{} q\sqrt{r}$, where $ p,q,r$ are positive integers and $ r$ is not divisible by the square of any prime. Find $ p\plus{}q\plus{}r$.
Determine all $ f:R\rightarrow R $ such that
$$ f(xf(y)+y^3)=yf(x)+f(y)^3 $$
Find all positive integers $m, n$ satisfying $n!+2^{n-1}=2^m$.
In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.
Let $a_1, a_2, \dots, a_n$ be real numbers, and let $b_1, b_2, \dots, b_n$ be distinct positive integers. Suppose that there is a polynomial $f(x)$ satisfying the identity
\[
(1-x)^n f(x) = 1 + \sum_{i=1}^n a_i x^{b_i}.
\]
Find a simple expression (not involving any sums) for $f(1)$ in terms of $b_1, b_2, \dots, b_n$ and $n$ (but independent of $a_1, a_2, \dots, a_n$).
Let $N$ be a positive integer. Define a sequence $a_0,a_1,\ldots$ by $a_0=0$, $a_1=1$, and $a_{n+1}+a_{n-1}=a_n(2-1/N)$ for $n\ge1$. Prove that $a_n<\sqrt{N+1}$ for all $n$.
[i]Evan O'Dorney.[/i]
Maria have $14$ days to train for an olympiad. The only conditions are that she cannot train by $3$ consecutive days and she cannot rest by $3$ consecutive days. Determine how many configurations of days(in training) she can reach her goal.
Let $S$ be a string of $99$ characters, $66$ of which are $A$ and $33$ are $B$. We call $S$ [i]good[/i] if, for each $n$ such that $1\le n \le 99$, the sub-string made from the first $n$ characters of $S$ has an odd number of distinct permutations. How many good strings are there? Which strings are good?
Let $n$ be a positive integer and let $a_1, \ldots, a_{n-1} $ be arbitrary real numbers. Define the sequences $u_0, \ldots, u_n $ and $v_0, \ldots, v_n $ inductively by $u_0 = u_1 = v_0 = v_1 = 1$, and $u_{k+1} = u_k + a_k u_{k-1}$, $v_{k+1} = v_k + a_{n-k} v_{k-1}$ for $k=1, \ldots, n-1.$
Prove that $u_n = v_n.$
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$.
[i]Proposed by Holden Mui[/i]
Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$,
\[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]
We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least
\[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}.
\]
Find all real constants c for which there exist strictly increasing sequence $a$ of positive integers such that $(a_{2n-1}+a_{2n})/{a_n}=c$ for all positive intеgers n.
Initially, on a board there a positive integer. If board contains the number $x,$ then we may additionally write the numbers $2x+1$ and $\frac{x}{x+2}.$ At some point 2008 is written on the board. Prove, that this number was there from the beginning.
A rational number $x$ is given. Prove that there exists a sequence $x_0, x_1, x_2, \ldots$ of rational numbers with the following properties:
(a) $x_0=x$;
(b) for every $n\ge1$, either $x_n = 2x_{n-1}$ or $x_n = 2x_{n-1} + \textstyle\frac{1}{n}$;
(c) $x_n$ is an integer for some $n$.
Alex the Kat and Kelvin the Frog play a game on a complete graph with $n$ vertices. Kelvin goes first, and the players take turns selecting either a single edge to remove from the graph, or a single vertex to remove from the graph. Removing a vertex also removes all edges incident to that vertex. The player who removes the final vertex wins the game. Assuming both players play perfectly, for which positive integers $n$ does Kelvin have a winning strategy?
$n$ pairs are formed from $n$ girls and $n$ boys at random.
What is the probability of having at least one pair of girls? For which $n$ the probability is over $0,9?$
Find all funtions $f : Z_{>0} \to Z_{>0}$ that satisfy $f(f(f(n))) + f(f(n)) + f(n) = 3n$ for all $n \in Z_{>0}$ .
Let $P$ be a finite set of primes, $A$ an infinite set of positive integers, where every element of $A$ has a prime factor not in $P$. Prove that there exist an infinite subset $B$ of $A$, such that the sum of elements in any finite subset of $B$ has a prime factor not in $P$.
The numbers $a_1,a_2$ and $a_3$ are distinct positive integers, such that
(i) $a_1$ is a divisor of $a_2+a_3+a_2a_3$;
(ii) $a_2$ is a divisor of $a_3+a_1+a_3a_1$;
(iii) $a_3$ is a divisor of $a_1+a_2+a_1a_2$.
Prove that $a_1,a_2$ and $a_3$ cannot all be prime.
Let $a_1,a_2,\dots,a_n$ be positive real numbers whose product is $1$. Show that the sum \[\textstyle\frac{a_1}{1+a_1}+\frac{a_2}{(1+a_1)(1+a_2)}+\frac{a_3}{(1+a_1)(1+a_2)(1+a_3)}+\cdots+\frac{a_n}{(1+a_1)(1+a_2)\cdots(1+a_n)}\] is greater than or equal to $\frac{2^n-1}{2^n}$.
Determine all injective functions defined on the set of positive integers into itself satisfying the following condition: If $S$ is a finite set of positive integers such that $\sum\limits_{s\in S}\frac{1}{s}$ is an integer, then $\sum\limits_{s\in S}\frac{1}{f\left( s\right) }$ is also an integer.
We have $2p-1$ integer numbers, where $p$ is a prime number. Prove that we can choose exactly $p$ numbers (from these $2p-1$ numbers) so that their sum is divisible by $p$.
Prove that if a person a has infinitely many descendants (children, their children, etc.), then a has an infinite sequence $a_0, a_1, \ldots$ of descendants (i.e., $a = a_0$ and for all $n \geq 1, a_{n+1}$ is always a child of $a_n$). It is assumed that no-one can have infinitely many children.
[i]Variant 1[/i]. Prove that if $a$ has infinitely many ancestors, then $a$ has an infinite descending sequence of ancestors (i.e., $a_0, a_1, \ldots$ where $a = a_0$ and $a_n$ is always a child of $a_{n+1}$).
[i]Variant 2.[/i] Prove that if someone has infinitely many ancestors, then all people cannot descend from $A(dam)$ and $E(ve)$.
Determine whether there exists a function $ f: \mathbb{N}\longrightarrow \mathbb{N}$ such that
$ f(n)\equal{}f(f(n\minus{}1))\plus{}f(f(n\plus{}1))$ for all natural numbers $ n\ge 2$.