Found problems: 85335
Determine the smallest integer $n\geq 4$ for which one can choose four different numbers $a,b,c$ and $d$ from any $n$ distinct integers such that $a+b-c-d$ is divisible by $20$.
Let $p$ be a prime number. Troy and Abed are playing a game. Troy writes a positive integer $X$ on the board, and gives a sequence $(a_n)_{n\in\mathbb{N}}$ of positive integers to Abed. Abed now makes a sequence of moves. The $n$-th move is the following:
$$\text{ Replace } Y \text{ currently written on the board with either } Y + a_n \text{ or } Y \cdot a_n.$$
Abed wins if at some point the number on the board is a multiple of $p$. Determine whether Abed can win, regardless of Troy’s choices, if
$a) p = 10^9 + 7$;
$b) p = 10^9 + 9$.
[i]Remark[/i]: Both $10^9 + 7$ and $10^9 + 9$ are prime.
[i]Proposed by Ivan Novak[/i]
We say that a finite set of points is [i]well scattered[/i] on the surface of a sphere if every open hemisphere (half the surface of the sphere without its boundary) contains at least one of the points. The set $\{ (1,0,0), (0,1,0), (0,0,1) \}$ is not well scattered on the unit sphere (the sphere of radius $1$ centered at the origin), but if you add the correct point $P$ it becomes well scattered. Find, with proof, all possible points $P$ that would make the set well scattered.
[b]p1[/b]. Prove that there is no interger $n$ such that $n^2 +1$ is divisible by $7$.
[b]p2.[/b] Find all solutions of the system
$$x^2-yz=1$$
$$y^2-xz=2$$
$$z^2-xy=3$$
[b]p3.[/b] A triangle with long legs is an isoceles triangle in which the length of the two equal sides is greater than or equal to the length of the remaining side. What is the maximum number, $n$ , of points in the plane with the property that every three of them form the vertices of a triangle with long legs?
Prove all assertions.
[b]p4.[/b] Prove that the area of a quadrilateral of sides $a, b, c, d$ which can be inscribed in a circle and circumscribed about another circle is given by $A=\sqrt{abcd}$
[b]p5.[/b] Prove that all of the squares of side length $$\frac{1}{2},\frac{1}{3},\frac{1}{4},\frac{1}{5},\frac{1}{6},...,\frac{1}{n},...$$ can fit inside a square of side length $1$ without overlap.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $\mathcal{P}$ be a regular $10$-gon in the coordinate plane. Mark computes the number of distinct $x$-coordinates that vertices of $\mathcal{P}$ take. Across all possible placements of $\mathcal{P}$ in the plane, compute the sum of all possible answers Mark could get.
$n\in{Z^{+}}$ and $A={1,\ldots ,n}$. $f: N\rightarrow N$ and $\sigma: N\rightarrow N$ are two permutations, if there is one $k\in A$ such that $(f\circ\sigma)(1),\ldots ,(f\circ\sigma)(k)$ is increasing and $(f\circ\sigma)(k),\ldots ,(f\circ\sigma)(n)$ is decreasing sequences we say that $f$ is good for $\sigma$. $S_\sigma$ shows the set of good functions for $\sigma$.
a) Prove that, $S_\sigma$ has got $2^{n-1}$ elements for every $\sigma$ permutation.
b)$n\geq 4$, prove that there are permutations $\sigma$ and $\tau$ such that, $S_{\sigma}\cap S_{\tau}=\phi$
.
$A_1A_2A_3A_4$ is a cyclic quadrilateral inscribed in circle $\Omega$, with side lengths $A_1A_2 = 28$, $A_2A_3 =12\sqrt3$, $A_3A_4 = 28\sqrt3$, and $A_4A_1 = 8$. Let $X$ be the intersection of $A_1A_3, A_2A_4$. Now, for $i = 1, 2, 3, 4$, let $\omega_i$ be the circle tangent to segments$ A_iX$, $A_{i+1}X$, and $\Omega$, where we take indices cyclically (mod $4$). Furthermore, for each $i$, say $\omega_i$ is tangent to $A_1A_3$ at $X_i $, $A_2A_4$ at $Y_i$ , and $\Omega$ at $T_i$ . Let $P_1$ be the intersection of $T_1X_1$ and $T_2X_2$, and $P_3$ the intersection of $T_3X_3$ and $T_4X_4$. Let $P_2$ be the intersection of $T_2Y_2$ and $T_3Y_3$, and $P_4$ the intersection of $T_1Y_1$ and $T_4Y_4$. Find the area of quadrilateral $P_1P_2P_3P_4$.
The incircle of $\triangle{ABC}$, with incentre $I$, meets $BC, CA$, and $AB$ at $D,E$, and $F$, respectively. The line $EF$ cuts the lines $BI$, $CI, BC$, and $DI$ at $K,L,M$, and $Q$, respectively. The line through the midpoint of $CL$ and $M$ meets $CK$ at $P$.
(a) Determine $\angle{BKC}$.
(b) Show that the lines $PQ$ and $CL$ are parallel.
Find all pairs of positive integers $(a,b)$ such that $\sqrt{a-1}+\sqrt{b-1}=\sqrt{ab-1}.$
A cyclic quadrilateral $ABCD$ is given. The lines $AB$ and $DC$ meet at point $E$, and the lines $BC$ and $AD$ meet at point $F$. Let $I$ be the incenter of triangle $AED$, and a ray with origin $F$ be perpendicular to the bisector of angle AID. In which ratio this ray dissects the angle $AFB$?
Consider the following two vertex-weighted graphs, and denote them as having vertex sets $V=\{v_1,v_2,\ldots,v_6\}$ and $W=\{w_1,w_2,\ldots,w_6\}$, respectively (numbered in the same direction and way). The weights in the second graph are such that for all $1\le i\le 6$, the weight of $w_i$ is the sum of the weights of the neighbors of $v_i$.
Determine the sum of the weights of the original graph.
$$\frac{1}{1\cdot2}+\frac{1}{2\cdot3}+\frac{1}{3\cdot4}+\dots+\frac{1}{2014\cdot2015}=\frac{m}{n},$$ where $\frac{m}{n}$ is irreducible.
a) Find $m+n.$
b) Find the remainder of division of $(m+3)^{1444}$ to $n{}$.
Circles $ \omega_{1}$ and $ \omega_{2}$ intersect at points $ A$ and $ B.$ Points $ C$ and $ D$ are on circles $ \omega_{1}$ and $ \omega_{2},$ respectively,
such that lines $ AC$ and $ AD$ are tangent to circles $ \omega_{2}$ and $ \omega_{1},$ respectively.
Let $ I_{1}$ and $ I_{2}$ be the incenters of triangles $ ABC$ and $ ABD,$ respectively. Segments $ I_{1}I_{2}$ and $ AB$ intersect at $ E$.
Prove that: $ \frac {1}{AE} \equal{} \frac {1}{AC} \plus{} \frac {1}{AD}$
Petryk factored the number $10^6 = 1000000$ as a product of $7$ distinct positive integers. Among all such factorings, find the one in which the largest of these $7$ factors is the smallest possible.
[i]Proposed by Bogdan Rublov[/i]
On a plane, several points are chosen so that a disc of radius $1$ can cover every $3$ of them. Prove that a disc of radius $1$ can cover all the points.
Show that from a set of $11$ square integers one can select six numbers $a^2,b^2,c^2,d^2,e^2,f^2$ such that $a^2+b^2+c^2 \equiv d^2+e^2+f^2\pmod{12}$.
Let $(a_n)$ be sequnce of positive integers such that first $k$ members $a_1,a_2,...,a_k$ are distinct positive integers, and for each $n>k$, number $a_n$ is the smallest positive integer that can't be represented as a sum of several (possibly one) of the numbers $a_1,a_2,...,a_{n-1}$. Prove that $a_n=2a_{n-1}$ for all sufficently large $n$.
Show that for all non-constant functions $f:\mathbb R\to\mathbb R$, there are two real numbers $x,y$ such that
$$f(x+f(y))>xf(y)+x.$$
In acute triangle $ABC$ ($\triangle ABC$ is not an isosceles triangle), $I$ is its incentre, and circle $ \omega$ is its inscribed circle. $\odot\omega$ touches $BC, CA, AB$ at $D, E, F$ respectively. $AD$ intersects with $\odot\omega$ at $J$ ($J\neq D$), and the circumcircle of $\triangle BCJ$ intersects $\odot\omega$ at $K$ ($K\neq J$). The circumcircle of $\triangle BFK$ and $\triangle CEK$ meet at $L$ ($L\neq K$). Let $M$ be the midpoint of the major arc $BAC$.
Prove that $M, I, L$ are collinear.
Consider the numbers $1$ through $6$ numbered on the coins below. Ella takes a coin from each of the three columns. Bella takes a coin from each of the remaining two columns. Cassandra takes the remaining coin. In how many ways could they have taken out the six coins?
[asy]
size(100);
draw(Circle((0,0),0.45));
label("$1$",(0,0));
draw(Circle((0,1),0.45));
label("$2$",(0,1));
draw(Circle((0,2),0.45));
label("$3$",(0,2));
draw(Circle((1,0),0.45));
label("$5$",(1,0));
draw(Circle((1,1),0.45));
label("$4$",(1,1));
draw(Circle((2,0),0.45));
label("$6$",(2,0));
[/asy]
$\textbf{(A) }9\qquad\textbf{(B) }12\qquad\textbf{(C) }15\qquad\textbf{(D) }18\qquad\textbf{(E) }20$
Find all strictly increasing functions $f : \mathbb{N} \to \mathbb{N} $ such that $\frac {f(x) + f(y)}{1 + f(x + y)}$ is a non-zero natural number, for all $x, y\in\mathbb{N}$.
A quadrilateral is inscribed in a circle of radius $200\sqrt{2}$. Three of the sides of this quadrilateral have length $200$. What is the length of the fourth side?
$\textbf{(A) }200\qquad \textbf{(B) }200\sqrt{2}\qquad\textbf{(C) }200\sqrt{3}\qquad\textbf{(D) }300\sqrt{2}\qquad\textbf{(E) } 500$
Solve the system of equations \[ |a_1-a_2|x_2+|a_1-a_3|x_3+|a_1-a_4|x_4=1 \] \[ |a_2-a_1|x_1+|a_2-a_3|x_3+|a_2-a_4|x_4=1 \] \[ |a_3-a_1|x_1+|a_3-a_2|x_2+|a_3-a_4|x_4=1 \] \[ |a_4-a_1|x_1+|a_4-a_2|x_2+|a_4-a_3|x_3=1 \] where $a_1, a_2, a_3, a_4$ are four different real numbers.
Find all $x,y\in\left(0,\frac{\pi}{2}\right)$ such that
\begin{align*}
\frac{\cos x}{\cos y}&=2\cos^2 y, \\
\frac{\sin x}{\sin y}&=2\sin^2 y.
\end{align*}
Find all positive integers $n$ with $n \ge 2$ such that the polynomial \[ P(a_1, a_2, ..., a_n) = a_1^n+a_2^n + ... + a_n^n - n a_1 a_2 ... a_n \] in the $n$ variables $a_1$, $a_2$, $\dots$, $a_n$ is irreducible over the real numbers, i.e. it cannot be factored as the product of two nonconstant polynomials with real coefficients.
[i]Proposed by Yang Liu[/i]