Found problems: 85335
Examine if we can place $9$ convex $6$-angled polygons the one next to the other (with common only one side or part of her) to construct a convex $39$-angled polygon.
Let be a function $ f:(0,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties:
$ \text{(i) } 2\lfloor x \rfloor \le f(x) \le 2 \lfloor x \rfloor +2,\quad\forall x\in (0,\infty ) $
$ \text{(ii) } f\circ f $ is monotone
Can $ f $ be non-monotone? Justify.
Suppose that $(f_{n})_{n=1}^{\infty}$ is a sequence of continuous functions on the interval $[0,1]$ such that
$$\int_{0}^{1}f_{m}(x)f_{n}(x) dx=
\begin{cases}
1& \text{if}\;n=m\\
0 & \text{if} \;n\ne m
\end{cases}$$
and $\sup\{|f_{n}(x)|: x\in [0,1]\, \text{and}\, n=1,2,\dots\}< \infty$.
Show that there exists no subsequence $(f_{n_{k}})$ of $(f_{n})$ such that $\lim_{k\to \infty}f_{n_{k}}(x)$ exist
for all $x\in [0,1]$.
Find all positive integer pairs $(m, n)$ such that $m- n$ is a positive prime number and $mn$ is a perfect square. Justify your answer.
Determine if there exists a positive integer $n$ such that $n^2+11$ is a prime number and $n+4$ is a perfect cube.
Let $P$ be a point inside or on the boundary of a square $ABCD$. Find the minimum and maximum values of $f(P ) = \angle ABP + \angle BCP + \angle CDP + \angle DAP$.
Let $ABCD$ be a quadrilateral with $AB\parallel CD$ and $AC \perp BD$. Let $O$ be the intersection of $AC$ and $BD$. On the rays $(OA$ and $(OB$ we consider the points $M$ and $N$ respectively such that $\angle ANC = \angle BMD = 90^\circ$. We denote with $E$ the midpoint of the segment $MN$. Prove that
a) $\triangle OMN \sim \triangle OBA$;
b) $OE \perp AB$.
[i]Claudiu-Stefan Popa[/i]
Triangle $ABC$ has $\angle A = 60^o$, $\angle B = 45$, and $AC = 6$. Let $D$ be on $AB$ such that $AD = 3$. There is exactly one point $E$ on $BC$ such that $\overline{DE}$ divides $ABC$ into two cyclic polygons. Compute $DE^2$.
Let $a, b, c, d$ three strictly positive real numbers such that \[a^{2}+b^{2}+c^{2}=d^{2}+e^{2},\] \[a^{4}+b^{4}+c^{4}=d^{4}+e^{4}.\] Compare \[a^{3}+b^{3}+c^{3}\] with \[d^{3}+e^{3},\]
Solve the system of equation
$$x+y+z=2;$$$$(x+y)(y+z)+(y+z)(z+x)+(z+x)(x+y)=1;$$$$x^2(y+z)+y^2(z+x)+z^2(x+y)=-6.$$
An infinitely large grid is filled such that each grid square contains exactly one of the digits $\{ 1,2,3,4\},$ each digit appears at least once, and the digit in each grid square equals the digit located $5$ squares above it as well as the digit located $5$ squares to the right. A group of $4$ horizontally adjacent digits or $4$ vertically adjacent digits is chosen randomly, and depending on its orientation is read left to right or top to bottom to form an $4$-digit integer. The expected value of this integer is also a $4$-digit integer $N$. Given this, find the last three digits of the sum of all possible values of $N$.
Suppose that $P(z), Q(z)$, and $R(z)$ are polynomials with real coefficients, having degrees $2$, $3$, and $6$, respectively, and constant terms $1$, $2$, and $3$, respectively. Let $N$ be the number of distinct complex numbers $z$ that satisfy the equation $P(z) \cdot Q(z)=R(z)$. What is the minimum possible value of $N$?
$\textbf{(A)}\: 0\qquad\textbf{(B)} \: 1\qquad\textbf{(C)} \: 2\qquad\textbf{(D)} \: 3\qquad\textbf{(E)} \: 5$
If the coefficient of the third term in the binomial expansion of $(1 - 3x)^{1/4}$ is $-a/b$, where $ a$ and $b$ are relatively prime integers, find $a+b$.
Find all real numbers $a$ such that exists function $\mathbb {R} \rightarrow \mathbb {R} $ satisfying the following conditions:
1) $f(f(x)) =xf(x)-ax$ for all real $x$
2) $f$ is not constant
3) $f$ takes the value $a$
It is election year in PUMACland, and for the presidential election there are $27$ people voting for either Vraj Patel or Vedant Shah. Each voter selects a candidate uniformly at random, and their ballots are labeled $1$ through $27.$
The election takes place as a series of rounds. In each round, the surviving ballots are sorted by label and separated into consecutive groups of three. From each group, the person with the most votes wins, and exactly one of the ballots bearing the winner’s name is allowed to proceed to the next round. This procedure continues until a single ballot remains, and the person whose name is on the ballot wins.
Alice, Bob, and Carol submitted ballots numbered $1, 15,$ and $27,$ respectively. Suppose that Alice, Bob, and Carol had all flipped their votes. If the probability that the outcome of the election would have changed is $\tfrac{a}{b}$ for relatively prime positive integers $a, b,$ find $a + b.$
Suppose that the circumradius $R$ and the inradius $r$ of a triangle $ABC$ satisfy $R = 2r$. Prove that the triangle is equilateral.
For a positive integer $n$, denote $c_n=2017^n$. A function $f: \mathbb{N} \rightarrow \mathbb{R}$ satisfies the following two conditions.
1. For all positive integers $m, n$, $f(m+n) \le 2017 \cdot f(m) \cdot f(n+325)$.
2. For all positive integer $n$, we have $0<f(c_{n+1})<f(c_n)^{2017}$.
Prove that there exists a sequence $a_1, a_2, \cdots $ which satisfies the following.
For all $n, k$ which satisfies $a_k<n$, we have $f(n)^{c_k} < f(c_k)^n$.
In triangle $ABC$ we have $|AB| \ne |AC|$. The bisectors of $\angle ABC$ and $\angle ACB$ meet $AC$ and $AB$ at $E$ and $F$, respectively, and intersect at I. If $|EI| = |FI|$ find the measure of $\angle BAC$.
Prove that for any positive integer $k$ there exist infinitely many positive integers $m$ such that $3^k\mid m^3+10$.
For a positive integer $n$, denote by $g(n)$ the number of strictly ascending triples chosen from the set $\{1, 2, ..., n\}$. Find the least positive integer $n$ such that the following holds:[i] The number $g(n)$ can be written as the product of three different prime numbers which are (not necessarily consecutive) members in an arithmetic progression with common difference $336$.[/i]
The diagram below shows a large triangle with area $72$. Each side of the triangle has been trisected, and line segments have been drawn between these trisection points parallel to the sides of the triangle. Find the area of the shaded region.
[asy]
size(4cm);
pair A,B1,B2,B3,C1,C2,C3,M,I,J;
A=origin;
dotfactor=4;
B1=dir(49);
B2=2*B1;
B3=3*B1;
C1=1.35*dir(127);
C2=2*C1;
C3=3*C1;
M=(B2+C2)/2;
I=B1+C2;
J=C1+B2;
pair d[] = {A,B1,B2,B3,C1,C2,C3,M,I,J};
filldraw(C1--B1--B2--J--I--C2--cycle,rgb(.76,.76,.76));
draw(A--C3--B3--cycle);
draw(C1--J^^C2--B2^^B1--I);
for(int i=0;i<10;++i){
dot(d[i]);
}
[/asy]
We define the function $Z(A)$ where we write the digits of $A$ in base $10$ form in reverse. (For example: $Z(521)=125$). Call a number $A$ $good$ if the first and last digits of $A$ are different, none of it's digits are $0$ and the equality: $$Z(A^2)=(Z(A))^2$$ happens. Find all such good numbers greater than $10^6$.\\
The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Consider $2018$ pairwise crossing circles no three of which are concurrent. These circles subdivide the plane into regions bounded by circular $edges$ that meet at $vertices$. Notice that there are an even number of vertices on each circle. Given the circle, alternately colour the vertices on that circle red and blue. In doing so for each circle, every vertex is coloured twice- once for each of the two circle that cross at that point. If the two colours agree at a vertex, then it is assigned that colour; otherwise, it becomes yellow. Show that, if some circle contains at least $2061$ yellow points, then the vertices of some region are all yellow.
Proposed by [i]India[/i]
Let n$\ge$2.Each 1x1 square of a nxn board is colored in black or white such that every black square has at least 3 white neighbors(Two squares are neighbors if they have a common side).What is the maximum number of black squares?