Found problems: 85335
Find all polynomials $P(x)$ for which there exists a sequence $a_1, a_2, a_3, \ldots$ of real numbers such that \[a_m + a_n = P(mn)\] for any positive integer $m$ and $n$.
Define the sequence $ (a_p)_{p\ge0}$ as follows: $ a_p\equal{}\displaystyle\frac{\binom p0}{2\cdot 4}\minus{}\frac{\binom p1}{3\cdot5}\plus{}\frac{\binom p2}{4\cdot6}\minus{}\ldots\plus{}(\minus{}1)^p\cdot\frac{\binom pp}{(p\plus{}2)(p\plus{}4)}$.
Find $ \lim_{n\to\infty}(a_0\plus{}a_1\plus{}\ldots\plus{}a_n)$.
Find all positive integers $n\geq 2$, for which there exist positive integers $a_1, a_2, ..., a_n$ such that both sets
$$\{a_1, a_2, ..., a_n\}\;\;\;and\;\;\;\{a_1+a_2, a_2+a_3, ..., a_n+a_1\}$$
contain $n$ consecutive integers.
Let $ABC$ be a triangle with centroid $G$ and $BC = 3$. If $ABC$ is similar to $GAB$, compute the area of $ABC$.
We call a number $n$ [i]interesting [/i]if for each permutation $\sigma$ of $1,2,\ldots,n$ there exist polynomials $P_1,P_2,\ldots ,P_n$ and $\epsilon > 0$ such that:
$i)$ $P_1(0)=P_2(0)=\ldots =P_n(0)$
$ii)$ $P_1(x)>P_2(x)>\ldots >P_n(x)$ for $-\epsilon<x<0$
$iii)$ $P_{\sigma (1)} (x)>P_{\sigma (2)}(x)> \ldots >P_{\sigma (n)} (x) $ for $0<x<\epsilon$
Find all [i]interesting [/i]$n$.
[i]Proposed by Mojtaba Zare Bidaki[/i]
The roots of the polynomial $P(x) = x^3 + 5x + 4$ are $r$, $s$, and $t$. Evaluate $(r+s)^4 (s+t)^4 (t+r)^4$.
[i]Proposed by Eugene Chen
[/i]
Sunay is in the bottom-left square of a checkerboard which is $5$ squares wide (the left-right direction) and $3$ squares tall (the up-down direction). From any square, he may move one square up, one square down, or one square to the right, provided that he does not fall off the checkerboard and provided that he does not revisit a square. How many paths are there for Sunay from the bottom-left square to the top-right square?
In town $ A,$ there are $ n$ girls and $ n$ boys, and each girl knows each boy. In town $ B,$ there are $ n$ girls $ g_1, g_2, \ldots, g_n$ and $ 2n \minus{} 1$ boys $ b_1, b_2, \ldots, b_{2n\minus{}1}.$ The girl $ g_i,$ $ i \equal{} 1, 2, \ldots, n,$ knows the boys $ b_1, b_2, \ldots, b_{2i\minus{}1},$ and no others. For all $ r \equal{} 1, 2, \ldots, n,$ denote by $ A(r),B(r)$ the number of different ways in which $ r$ girls from town $ A,$ respectively town $ B,$ can dance with $ r$ boys from their own town, forming $ r$ pairs, each girl with a boy she knows. Prove that $ A(r) \equal{} B(r)$ for each $ r \equal{} 1, 2, \ldots, n.$
A rectangle $ABCD$ is given. On the side $AB$, $n$ different points are chosen strictly between $A$ and $B$. Similarly, $m$ different points are chosen on the side $AD$. Lines are drawn from the points parallel to the sides. How many rectangles are formed in this way? (One possibility is shown in the figure.)
[img]https://cdn.artofproblemsolving.com/attachments/0/1/dcf48e4ce318fdcb8c7088a34fac226e26e246.png[/img]
Suppose $(u,v)$ is an inner product on $\mathbb R^{n}$ and $f: \mathbb R^{n}\longrightarrow\mathbb R^{n}$ is an isometry, that $f(0)=0$.
1) Prove that for each $u,v$ we have $(u,v)=(f(u),f(v)$
2) Prove that $f$ is linear.
$a,b>1$ - are naturals, and $a^2+b,a+b^2$ are primes. Prove $(ab+1,a+b)=1$
Triangle $ABC$ is inscribed in circle $\omega$. Point $P$ lies inside triangle $ABC$.Lines $AP,BP$ and $CP$ intersect $\omega$ again at points $A_1$, $B_1$ and $C_1$ (other than $A, B, C$), respectively. The tangent lines to $\omega$ at $A_1$ and $B_1$ intersect at $C_2$.The tangent lines to $\omega$ at $B_1$ and $C_1$ intersect at $A_2$. The tangent lines to $\omega$ at $C_1$ and $A_1$ intersect at $B_2$. Prove that the lines $AA_2,BB_2$ and $CC_2$ are concurrent.
Let $m$ and $n$ be any two odd numbers, with $n$ less than $m$. The largest integer which divides all possible numbers of the form $m^2-n^2$ is:
$ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 16 $
Solve in positive integers $x^{100}-y^{100}=100!$
In the triangle $ABC$, $\angle{B} = 120^{\circ}$, point $M$ is the midpoint of side $AC$. On the sides $AB$ and $BC$, the points $K$ and $L$ are chosen such that $KL \parallel AC$. Prove that $MK + ML \geq MA$.
Given 98 points in a circle. Mary and Joseph play alternatively in the next way:
- Each one draw a segment joining two points that have not been joined before.
The game ends when the 98 points have been used as end points of a segments at least once. The winner is the person that draw the last segment. If Joseph starts the game, who can assure that is going to win the game.
Anthony the ant is at point $A$ of regular tetrahedron $ABCD$ with side length $4$. Anthony wishes to crawl on the surface of the tetrahedron to the midpoint of $\overline{BC}$. However, he does not want to touch the interior of face $\vartriangle ABC$, since it is covered with lava. What is the shortest distance Anthony must travel?
In triangle $ABC$ with $AB>AC$ and incenter $I$, the incircle touches $BC,CA,AB$ at $D,E,F$ respectively. $M$ is the midpoint of $BC$, and the altitude at $A$ meets $BC$ at $H$. Ray $AI$ meets lines $DE$ and $DF$ at $K$ and $L$, respectively. Prove that the points $M,L,H,K$ are concyclic.
Homer began peeling a pile of 44 potatoes at the rate of 3 potatoes per minute. Four minutes later Christen joined him and peeled at the rate of 5 potatoes per minute. When they finished, how many potatoes had Christen peeled?
$ \text{(A)}\ 20\qquad\text{(B)}\ 24\qquad\text{(C)}\ 32\qquad\text{(D)}\ 33\qquad\text{(E)}\ 40 $
In a summer camp there are $n$ girls $D_1,D_2, ... ,D_n$ and $2n-1$ boys $C_1,C_2, ...,C_{2n-1}$.
The girl $D_i, i = 1,2,... ,n,$ knows only the boys $C_1,C_2, ... ,C_{2i-1}$.
Let $A(n, r)$ be the number of different ways in which $r$ girls can dance with $r$ boys forming $r$ pairs,
each girl with a boy she knows.
Prove that $A(n, r) = \binom{n}{r} \frac{r!}{(n-r)!}.$
Let $m$ and $n$ be integers greater than $2$, and let $A$ and $B$ be non-constant polynomials with complex coefficients, at least one of which has a degree greater than $1$. Prove that if the degree of the polynomial $A^m-B^n$ is less than $\min(m,n)$, then $A^m=B^n$.
[i]Proposed by Tobi Moektijono, Indonesia[/i]
In triangle $ABC$, $90^{o}> \angle A> \angle B> \angle C$. Let the circumcenter and orthocenter of the triangle be $O$ and $H$. $OH$ intersects $BC$ at $T$ and the circumcenter of $(AHO)$ is $X$. Prove that the reflection of $H$ over $XT$ lies on the circumcircle of triangle $ABC$.
Prove that it is impossible to arrange the numbers $1,2,\ldots,1997$ around a circle in such a way that, if $x$ and $y$ are any two neighboring numbers, then $499\le|x-y|\le997$.
Prove that for each $n \in \mathbb N$ there exist natural numbers $a_1<a_2<...<a_n$ such that $\phi(a_1)>\phi(a_2)>...>\phi(a_n)$.
[i]Proposed by Amirhossein Gorzi[/i]
Do there exist polynomials $p(x), q(x), r(x)$ whose coefficients are positive integers such that $p(x) = (x^{2}-3x+3) q(x)$ and $q(x) = (\frac{x^{2}}{20}-\frac{x}{15}+\frac{1}{12}) r(x)$?