Found problems: 85335
Prove that for any prime $p$, there exist integers $x,y,z,$ and $w$ such that $x^2+y^2+z^2-wp=0$ and $0<w<p$
Points $C$ and $D$ lie on opposite sides of line $\overline{AB}$. Let $M$ and $N$ be the centroids of $\triangle ABC$ and $\triangle ABD$ respectively. If $AB=841$, $BC=840$, $AC=41$, $AD=609$, and $BD=580$, find the sum of the numerator and denominator of the value of $MN$ when expressed as a fraction in lowest terms.
Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.
Let’s consider three pairwise non-parallel straight constant lines in the plane. Three points are moving along these lines with different nonzero velocities, one on each line (we consider the movement to have taken place for infinite time and continue infinitely in the future). Is it possible to determine these straight lines, the velocities of each moving point and their positions at some “zero” moment in such a way that the points never were, are or will be collinear?
The sequence $1, 2, \dots, 2023, 2024$ is written on a whiteboard. Every second, Megavan chooses two integers $a$ and $b$, and four consecutive numbers on the whiteboard. Then counting from the left, he adds $a$ to the 1st and 3rd of those numbers, and adds $b$ to the 2nd and 4th of those numbers. Can he achieve the sequence $2024, 2023, \dots, 2, 1$ in a finite number of moves?
[i](Proposed by Avan Lim Zenn Ee)[/i]
[b]a)[/b] Prove that, for any point in the interior of a triangle, there are two points on the sides of this triangle such that the resultant of the vectors from the interior point those two points is the vector $ 0. $
[b]b)[/b] Prove that, for any point in the interior of a triangle, there are three points on the sides of this triangle such that the resultant of the vectors from the interior point those three points is the vector $ 0. $
The angles of a convex $n$-gon are $a,2a, ... ,na$. Find all possible values of $n$ and the corresponding values of $a$.
For a positive integer, we define it's [i]set of exponents[/i] the unordered list of all the exponents of the primes, in it`s decomposition. For example, $18=2\cdot 3^{2}$ has it`s set of exponents $1,2$ and $300=2^{2}\cdot 3\cdot 5^{2}$ has it`s set of exponents $1,2,2$. There are given two arithmetical progressions $\big(a_{n}\big)_{n}$ and $\big(b_{n}\big)_{n}$, such that for any positive integer $n$, $a_{n}$ and $b_{n}$ have the same set of exponents. Prove that the progressions are proportional (that is, there is $k$ such that $a_{n}=kb_{n}$ for any $n$).
[i]Proposed by A. Golovanov[/i]
Select $ n$ points on a circle independently with uniform distribution. Let $ P_n$ be the probability that the center of the
circle is in the interior of the convex hull of these $ n$ points. Calculate the probabilities $ P_3$ and $ P_4$. [A. Renyi]
$(SWE 3)$ Find the natural number $n$ with the following properties:
$(1)$ Let $S = \{P_1, P_2, \cdots\}$ be an arbitrary finite set of points in the plane, and $r_j$ the distance from $P_j$ to the origin $O.$ We assign to each $P_j$ the closed disk $D_j$ with center $P_j$ and radius $r_j$. Then some $n$ of these disks contain all points of $S.$
$(2)$ $n$ is the smallest integer with the above property.
Find the smallest positive integer $G$ such that there exist distinct positive integers $a, b, c$ with the following properties:
$\: \bullet \: \gcd(a, b, c) = G$.
$\: \bullet \: \text{lcm}(a, b) = \text{lcm}(a, c) = \text{lcm}(b, c)$.
$\: \bullet \: \frac{1}{a} + \frac{1}{b}, \frac{1}{a} + \frac{1}{c},$ and $\frac{1}{b} + \frac{1}{c}$ are reciprocals of integers.
$\: \bullet \: \gcd(a, b) + \gcd(a, c) + \gcd(b, c) = 16G$.
a) Divide $a^{128} - b^{128}$ by $(a + b)(a^2 + b^2)(a^4 + b^4)(a^8 + b^8)(a^{16} + b^{16})(a^{32} + b^{32})(a^{64} + b^{64}) $.
b) Divide $a^{2^k} - b^{2^k}$ by $(a + b)(a^2 + b^2)(a^4 + b^4) ... (a^{2^{k-1}} + b^{2^{k-1}})$
(a) Prove that from $2007$ given positive integers, one of them can be chosen so the product of the remaining numbers is expressible in the form $a^2 - b^2$ for some positive integers $a$ and $b$. (2)
(b) One of $2007$ given positive integers is $2006$. Prove that if there is a unique number among them such that the product of the remaining numbers is expressible in the form $a^2 - b^2$ for some positive integers $a$ and $b$, then this unique number is $2006$. (2)
Let $P_1,P_2,\dots,P_n$ be $n$ distinct points over a line in the plane ($n\geq2$). Consider all the circumferences with diameters $P_iP_j$ ($1\leq{i,j}\leq{n}$) and they are painted with $k$ given colors. Lets call this configuration a ($n,k$)-cloud.
For each positive integer $k$, find all the positive integers $n$ such that every possible ($n,k$)-cloud has two mutually exterior tangent circumferences of the same color.
Of all functions $h : Z_{>0} \to Z_{\ge 0}$, choose one satisfying $h(ab) = ah(b) + bh(a)$ for all $a, b \in Z_{>0}$ and $h(p) = p$ for all prime numbers $p$. Find the sum of all positive integers $n\le 100$ such that $h(n) = 4n$.
Five girls and five boys took part in a competition. Suppose that we can number the boys and girls $1, 2, 3, 4, 5$ such that for each $1 \leq i,j \leq 5$, there are exactly $|i-j|$ contestants that the girl numbered $i$ and the boy numbered $j$ both know. Let $a_i$ and $b_i$ be the number of contestants that the girl numbered $i$ knows and the number of contestants that the boy numbered $i$ knows respectively. Find the minimum value of $\max(\sum\limits_{i=1}^5a_i, \sum\limits_{i=1}^5b_i)$.
(Note that for a pair of contestants $A$ and $B$, $A$ knowing $B$ doesn't mean that $B$ knows $A$ and a contestant cannot know themself.)
Three similar acute-angled triangles $AC_1B, BA_1C$ and $CB_1A$ are constructed on the outer side of the acute-angled triangle $ABC$. (Equal triples of the angles are $AB_1C, ABC_1, A_1BC$ and $BA_1C, BAC_1, B_1AC$.)
a) Prove that the circles circumscribed around the outer triangles intersect in one point.
b) Prove that the straight lines $AA_1, BB_1$ and $CC_1$ intersect in the same point
Let $n{}$ and $m$ be positive integers, $n>m>1$. Let $n{}$ divided by $m$ have partial quotient $q$ and remainder $r$ (so that $n = qm + r$, where $r\in\{0,1,...,m-1\}$). Let $n-1$ divided by $m$ have partial quotient $q^{'}$ and remainder $r^{'}$.
a) It appears that $q+q^{'} =r +r^{'} = 99$. Find all possible values of $n{}$.
b) Prove that if $q+q^{'} =r +r^{'}$, then $2n$ is a perfect square.
Prove there exist infinitely many pairs $(x,y)$ of integers $1<x<y$, such that $x^3+y \mid x+y^3$.
([i]Dan Schwarz[/i])
For each lattice point on the Cartesian Coordinate Plane, one puts a positive integer at the lattice such that [b]for any given rectangle with sides parallel to coordinate axes, the sum of the number inside the rectangle is not a prime. [/b] Find the minimal possible value of the maximum of all numbers.
Consider a pyramid $ABCD$ whose base $ABC$ is a triangle. Through a point $M$ of the edge $DA$, the lines $MN$ and $MP$ on the plane of the surfaces $DAB$ and $DAC$ are drawn respectively, such that $N$ is on $DB$ and $P$ is on $DC$ and $ABNM$ , $ACPM$ are cyclic quadrilaterals.
a) Prove that $BCPN$ is also a cyclic quadrilateral.
b) Prove that the points $A,B,C,M,N, P$ lie on a sphere.
Given are the real line and the two unique marked points $0$ and $1$. We can perform as many times as we want the following operation: we take two already marked points $a$ and $b$ and mark the reflection of $a$ over $b$. Let $f(n)$ be the minimum number of operations needed to mark on the real line the number $n$ (which is the number at a distance $\left| n\right|$ from $0$ and it is on the right of $0$ if $n>0$ and on the left of $0$ if $n<0$). For example, $f(0)=f(1)=0$ and $f(-1)=f(2)=1$. Find $f(n)$.
Suppose for real numbers $a, b, c$ we know $a + \dfrac 1b = 3,$ and $b + \dfrac 3c = \dfrac 13.$ What is the value of $c + \dfrac{27}a?$
$$
\mathrm a. ~ 1\qquad \mathrm b.~3\qquad \mathrm c. ~8 \qquad \mathrm d. ~9 \qquad \mathrm e. ~21
$$
Let $ g,f: \mathbb C\longrightarrow\mathbb C$ be two continuous functions such that for each $ z\neq 0$, $ g(z)\equal{}f(\frac1z)$. Prove that there is a $ z\in\mathbb C$ such that $ f(\frac1z)\equal{}f(\minus{}\bar z)$
For each non-negative integer $n$, $F_n(x)$ is a polynomial in $x$ of degree $n$. Prove that if the identity
\[F_n(2x)=\sum_{r=0}^{n} (-1)^{n-r} \binom nr 2^r F_r(x)\]
holds for each n, then
\[F_n(tx)=\sum_{r=0}^{n} \binom nr t^r (1-t)^{n-r} F_r(x)\]