Found problems: 85335
Find the formula for the general term of the sequence an, for which $a_1 = 1$, $a_2 = 3$, $a_{n+1} = 3a_n-2a_{n-1}$ (you need to express an in terms of $n$).
Let $p = 101$ and let $S$ be the set of $p$-tuples $(a_1, a_2, \dots, a_p) \in \mathbb{Z}^p$ of integers. Let $N$ denote the number of functions $f: S \to \{0, 1, \dots, p-1\}$ such that
[list]
[*] $f(a + b) + f(a - b) \equiv 2\big(f(a) + f(b)\big) \pmod{p}$ for all $a, b \in S$, and
[*] $f(a) = f(b)$ whenever all components of $a-b$ are divisible by $p$.
[/list]
Compute the number of positive integer divisors of $N$. (Here addition and subtraction in $\mathbb{Z}^p$ are done component-wise.)
[i]Proposed by Ankan Bhattacharya[/i]
On a plane, two equilateral triangles (of side length $1$) share a side, and a circle is drawn with the common side as a diameter. Find the area of the set of all points that lie inside exactly one of these shapes.
[i]Proposed by Howard Halim[/i]
Find all functions $f:\mathbb{R}\to\mathbb{R}$ satisfying the equation \[|x|f(y)+yf(x)=f(xy)+f(x^2)+f(f(y))\] for all real numbers $x$ and $y$.
The cells of a $2021\times 2021$ table are filled with numbers using the following rule. The bottom left cell, which we label with coordinate $(1, 1)$, contains the number $0$. For every other cell $C$, we consider a route from $(1, 1)$ to $C$, where at each step we can only go one cell to the right or one cell up (not diagonally). If we take the number of steps in the route and add the numbers from the cells along the route, we obtain the number in cell $C$. For example, the cell with coordinate $(2, 1)$ contains $1 = 1 + 0$, the cell with coordinate $(3, 1)$ contains $3 = 2 + 0 + 1$, and the cell with coordinate $(3, 2)$ contains $7 = 3 + 0 + 1 + 3$. What is the last digit of the number in the cell $(2021, 2021)$?
Let $O{}$ be the circumcenter of an acute triangle $ABC$. Let $M{}$ be the midpoint of $AC$. The straight line $BO$ intersects the altitudes $AA_1{}$ and $CC_1{}$ at the points $H_a$ and $H_c$ respectively. The circumcircles of the triangles $BH_aA$ and $BH_cC$ have a second point of intersection $K{}$. Prove that $K{}$ lies on the straight line $BM$.
[i]Mikhail Evdokimov[/i]
A week ago, Sandy’s seasonal Little League batting average was $360$. After five more at bats this week, Sandy’s batting average is up to $400$. What is the smallest number of hits that Sandy could have had this season?
Let $n$ be a natural number, $n > 2$. Prove that if $\frac{b^n-1}{b-1}$ is a prime power for some positive integer $b$ then $n$ is prime.
The last digit of the number A = $7^{2011}$ is ?
An auditorium has two rows of seats, with $50$ seats in each row. $100$ indistinguishable people sit in the seats one at a time, subject to the condition that each person, except for the first person to sit in each row, must sit to the left or right of an occupied seat, and no two people can sit in the same seat. In how many ways can this process occur?
Let $ ABC$ be an acute-angled triangle and let $ D,E,F$ be the feet of perpendiculars from $ A,B,C$ respectively to $ BC,CA,AB .$ Let the perpendiculars from $ F$ to $ CB,CA,AD,BE$ meet them in $ P,Q,M,N$ respectively. Prove that the points $ P,Q,M,N$ are collinear.
Edges of a planar graph $G$ are colored either with blue or red. Prove that there is a vertex like $v$ such that when we go around $v$ through a complete cycle, edges with the endpoint at $v$ change their color at most two times.
Clarifications for complete cycle:
If all the edges with one endpoint at $v$ are $(v,u_1),(v,u_2),\ldots,(v,u_k)$ such that $u_1,u_2,\ldots,u_k$ are clockwise with respect to $v$ then in the sequence of $(v,u_1),(v,u_2),\ldots,(v,u_k),(v,u_1)$ there are at most two $j$ such that colours of $(v,u_j),(v,u_{j+1})$ ($j \mod k$) differ.
For how many ordered pairs of positive integers $(a,b)$ with $a,b<1000$ is it true that $a$ times $b$ is equal to $b^2$ divided by $a$? For example, $3$ times $9$ is equal to $9^2$ divided by $3$.
[i]Ray Li[/i]
Two circles centered at $O_1$ and $O_2$ have radii $2$ and $3$ and are externally tangent at $P$. The common external tangent of the two circles intersects the line $O_1O_2$ at $Q$. What is the length of $PQ$ ?
Show in an acute triangle $ABC$ that $\cot A + \cot B + \cot C \ge \dfrac{12[ABC]}{a^2+b^2+c^2}$.
Eddy and Moor play a game with the following rules:
[list=a]
[*] The game begins with a pile of $N$ stones, where $N$ is a positive integer. [/*]
[*] The $2$ players alternate taking turns (e.g. Eddy moves, then Moor moves, then Eddy moves, and so on). [/*]
[*] During a player's turn, given $a$ stones remaining in the pile, the player may remove $b$ stones from the pile, where $\gcd(a,b)=1$ and $b\leq a$. [/*]
[*] If a player cannot make a move, they lose. [/*]
[/list]
For example, if Eddy goes first and $N=4$, then Eddy can remove $3$ stones from the pile (since $3\leq4$ and $\gcd(3,4)=1$), leaving $1$ stone in the pile. Moor can then remove $1$ stone from the pile (since $1\leq1$ and $\gcd(1,1)=1$), leaving $0$ stones in the pile. Since Eddy cannot remove stones from an empty pile, he cannot make a move, and therefore loses.
Both Eddy and Moor want to win, so they will both always make the best possible move. If Eddy moves first, for how many values of $N<2016$ can Eddy win no matter what moves Moor chooses?
Let a line, perpendicular to side $AD$ of parallelogram $ABCD$ passing through point $B$, intersect line $CD$ at point $M$, and a line, passing through point $B$ and perpendicular to side $CD$, intersect line $AD$ at point $N$. Prove that the line passing through point $B$ perpendicular to the diagonal $AC$, passes through the midpoint of the segment $MN$.
Steve's empty swimming pool will hold $ 24,000$ gallons of water when full. It will be filled by $ 4$ hoses, each of which supplies $ 2.5$ gallons of water per minute. How many hours will it take to fill Steve's pool?
$ \textbf{(A)}\ 40 \qquad
\textbf{(B)}\ 42 \qquad
\textbf{(C)}\ 44 \qquad
\textbf{(D)}\ 46 \qquad
\textbf{(E)}\ 48$
What is the largest $n$ such that there exists a non-degenerate convex $n$-gon such that each of its angles are an integer number of degrees, and are all distinct?
Call a nonempty set $V$ of nonzero integers \emph{victorious} if there exists a polynomial $P(x)$ with integer coefficients such that $P(0)=330$ and that $P(v)=2|v|$ holds for all elements $v\in V$. Find the number of victorious sets.
[i]Proposed by Yannick Yao[/i]
How many ordered pairs $(p,n)$ are there such that $(1+p)^n = 1+pn + n^p$ where $p$ is a prime and $n$ is a positive integer?
$
\textbf{(A)}\ 5
\qquad\textbf{(B)}\ 2
\qquad\textbf{(C)}\ 1
\qquad\textbf{(D)}\ 0
\qquad\textbf{(E)}\ \text{None of the preceding}
$
How many of the numbers, $100,101,\ldots,999$, have three different digits in increasing order or in decreasing order?
$\text{(A)} \ 120 \qquad \text{(B)} \ 168 \qquad \text{(C)} \ 204 \qquad \text{(D)} \ 216 \qquad \text{(E)} \ 240$
Given a convex quadrilateral $ABCD$, side $AB$ is not parallel to side $CD$. The circle $O_1$ passing through $A$ and $B$ is tangent to side $CD$ at $P$. The circle $O_2$ passing through $C$ and $D$ is tangent to side $AB$ at $Q$. Circle $O_1$ and circle $O_2$ meet at $E$ and $F$. Prove that $EF$ bisects segment $PQ$ if and only if $BC\parallel AD$.
On an infinite checkered plane $100$ chips in form of a $10\times 10$ square are given. These chips are rearranged such that any two adjacent (by side) chips are again adjacent, moreover no two chips are in the same cell. Prove that the chips are again in form of a square.
Let $ABCD$ be a square, such that the length of its sides are integers. This square is divided in $89$ smaller squares, $88$ squares that have sides with length $1$, and $1$ square that has sides with length $n$, where $n$ is an integer larger than $1$. Find all possible lengths for the sides of $ABCD$.