Found problems: 85335
Find the smallest positive real $\alpha$, such that $$\frac{x+y} {2}\geq \alpha\sqrt{xy}+(1 - \alpha)\sqrt{\frac{x^2+y^2}{2}}$$ for all positive reals $x, y$.
$S$ is a point inside triangle $ABC$ such that the areas of the triangles $ABS$, $BCS$ and $CAS$ are all equal. Prove that $S$ is the centroid of $ABC$.
Let $S$ be a set of positive integers $n_1, n_2, \cdots, n_6$ and let $n(f)$ denote the number $n_1n_{f(1)} +n_2n_{f(2)} +\cdots+n_6n_{f(6)}$, where $f$ is a permutation of $\{1, 2, . . . , 6\}$. Let
\[\Omega=\{n(f) | f \text{ is a permutation of } \{1, 2, . . . , 6\} \} \]
Give an example of positive integers $n_1, \cdots, n_6$ such that $\Omega$ contains as many elements as possible and determine the number of elements of $\Omega$.
Bored of waiting for his plane to travel to the International Mathematics Olympiad, Daniel began to write powers of $2$ in a list in his notebook as follows:
$\bullet$ Starting with the number $1$, Daniel writes the next power of $2$ at the end of his list and reverses the order of the numbers in the list.
Let us call such a modification of the list, including the first step, a [i]move[/i]. The list in each of the first $4$ moves it looks like this:
$$1 \,\,\,\, \to 2, 1 \,\,\,\, \,\,\,\, \to 4, 1, 2 \,\,\,\, \,\,\,\, \to 8, 2, 1, 4$$
Daniel plans to carry out operations until his plane arrives, but he is worried let the list grow too. After $2020$ moves, what is the sum of the first $1010$ numbers?
Suppose that $$\frac{(\sqrt2)^5 + 1}{\sqrt2 + 1} \times \frac{2^5 + 1}{2 + 1} \times \frac{4^5 + 1}{4 + 1} \times \frac{16^5 + 1}{16 + 1} =\frac{m}{7 + 3\sqrt2}$$ for some integer $m$. How many $0$’s are in the binary representation of $m$? (For example, the number $20 = 10100_2$ has three $0$’s in its binary representation.)
Let $n$ be a natural number and let $P (t) = 1 + t + t^2 + ... + t^{2n}$.
If $x \in R$ such that $P (x)$ and $P (x^2)$ are rational numbers, prove that $x$ is rational number.
Construction Mayhem University has been on a mission to expand and improve its campus! The university has recently adopted a new construction schedule where a new project begins every two days. Each project will take exactly one more day than the previous one to complete (so the first project takes 3, the second takes 4, and so on.)
Suppose the new schedule starts on Day 1. On which day will there first be at least $10$ projects in place at the same time?
Initially, the numbers $1,1,-1$ written on the board.At every step,Mikail chooses the two numbers $a,b$ and substitutes them with $2a+c$ and $\frac{b-c}{2}$ where $c$ is the unchosen number on the board. Prove that at least $1$ negative number must be remained on the board at any step.
Let $ M$ be the set of all polynomials $ P(x)$ with pairwise distinct integer roots, integer coefficients and all absolut values of the coefficients less than $ 2007$. Which is the highest degree among all the polynomials of the set $ M$?
Determine all functions $f : \mathbb {N} \rightarrow \mathbb {N}$ such that $f$ is increasing (not necessarily strictly) and the numbers $f(n)+n+1$ and $f(f(n))-f(n)$ are both perfect squares for every positive integer $n$.
Find all real numbers $x$ such that:
\[
2^x + 3^x + 6^x - 4^x - 9^x = 1,
\]
and prove that there are no others.
Show that the four perpendiculars dropped from the midpoints of the sides of a cyclic quadrilateral to the respective opposite sides are concurrent.
[b]Note by Darij:[/b] A [i]cyclic quadrilateral [/i]is a quadrilateral inscribed in a circle.
We will call a positive integer [i]good [/i] if all its digits are nonzero. A good integer will be called [i]special [/i] if it has at least $k$ digits and their values strictly increase from left to right. Let a good integer be given. At each move, one may either add some special integer to its digital expression from the left or from the right, or insert a special integer between any two its digits, or remove a special number from its digital expression.What is the largest $k$ such that any good integer can be turned into any other good integer by such moves?
Given a positive integer $n$, suppose that $P(x,y)$ is a real polynomial such that
\[P(x,y)=\frac{1}{1+x+y} \hspace{0.5cm} \text{for all $x,y\in\{0,1,2,\dots,n\}$} \] What is the minimum degree of $P$?
[i]Proposed by Loke Zhi Kin[/i]
In the triangle $ABC$ the length of side $AB$, and height $AH$ are known. also we know that $\angle B = 2 \angle C.$ Plot this triangle.
How many rectangles can be formed by the vertices of a cube? (Note: square is also a special rectangle).
A. $6$ B. $8$ C. $12$ D. $18$ E. $16$
Let $k$ be a positive integer congruent to $1$ modulo $4$ which is not a perfect square and let $a=\frac{1+\sqrt{k}}{2}$.
Show that $\{\left \lfloor{a^2n}\right \rfloor-\left \lfloor{a\left \lfloor{an}\right \rfloor}\right \rfloor : n \in \mathbb{N}_{>0}\}=\{1 , 2 , \ldots ,\left \lfloor{a}\right \rfloor\}$.
Determine if there exists a finite set $A$ of positive integers satisfying the following condition: for each $a\in{A}$ at least one of two numbers $2a$ and
$\frac{a}{3}$ belongs to $A$.
Let $A_1A_2A_3A_4$ be a tetrahedron. We construct four mutually tangent spheres $S_1,S_2,S_3,S_4$ with centers $A_1,A_2,A_3,A_4$ respectively. Suppose that there exists a point $Q$ such that we can construct two spheres centered at $Q$ satisfying the following conditions:
i) One sphere with radius $r$ is tangent to $S_1,S_2,S_3,S_4$;
ii) One sphere with radius $R$ is tangent to every edges of tetrahedron $A_1A_2A_3A_4$.
Prove that $A_1A_2A_3A_4$ is a regular tetrahedron.
Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $200$ distinct points.
(Note that for $3$ distinct points, the minimum number of lines is $3$ and for $4$ distinct points, the minimum is $4$)
Denote by $S$ the set of all primes $p$ such that the decimal representation of $\frac{1}{p}$ has the fundamental period of divisible by $3$. For every $p \in S$ such that $\frac{1}{p}$ has the fundamental period $3r$ one may write \[\frac{1}{p}= 0.a_{1}a_{2}\cdots a_{3r}a_{1}a_{2}\cdots a_{3r}\cdots,\] where $r=r(p)$. For every $p \in S$ and every integer $k \ge 1$ define \[f(k, p)=a_{k}+a_{k+r(p)}+a_{k+2r(p)}.\] [list=a] [*] Prove that $S$ is finite. [*] Find the highest value of $f(k, p)$ for $k \ge 1$ and $p \in S$.[/list]
Tony has an old sticky toy spider that very slowly "crawls" down a wall after being stuck to the wall. In fact, left untouched, the toy spider crawls down at a rate of one inch for every two hours it's left stuck to the wall. One morning, at around $9$ o' clock, Tony sticks the spider to the wall in the living room three feet above the floor. Over the next few mornings, Tony moves the spider up three feet from the point where he finds it. If the wall in the living room is $18$ feet high, after how many days (days after the first day Tony places the spider on the wall) will Tony run out of room to place the spider three feet higher?
You wish to color every vertex, edge, face, and the interior of a cube one color each such that no two adjacent objects are the same color. Faces are adjacent if they share an edge. Edges are adjacent if they share a vertex. The interior is adjacent to all of its faces, edges, and vertices. Each face is adjacent to all of its edges and vertices. Each edge is adjacent to both of its vertices. What is the minimum number of colors required to do this?
Let $n\geq1$ be an integer and let $t_1<t_2<\dots<t_n$ be positive integers. In a group of $t_n+1$ people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following two conditions to hold at the same time:
(i) The number of games played by each person is one of $t_1,t_2,\dots,t_n$.
(ii) For every $i$ with $1\leq i\leq n$, there is someone who has played exactly $t_i$ games of chess.
A two-inch cube $(2\times 2\times 2)$ of silver weighs 3 pounds and is worth \$200. How much is a three-inch cube of silver worth?
$\textbf{(A)}\ 300\text{ dollars} \qquad \textbf{(B)}\ 375\text{ dollars} \qquad \textbf{(C)}\ 450\text{ dollars} \qquad \textbf{(D)}\ 560\text{ dollars} \qquad \textbf{(E)}\ 675\text{ dollars}$