Found problems: 85335
Give two congruent regular triangular pyramids, stick their bottom surfaces together. Then ,it becomes a hexahedron with all dihedral angles equal. The length of the shortest edge of the hexahedron is $2$. Then, the furthest distance between two vertexes is________.
Determine all sequences of real numbers $a_1$, $a_2$, $\ldots$, $a_{1995}$ which satisfy:
\[ 2\sqrt{a_n - (n - 1)} \geq a_{n+1} - (n - 1), \ \mbox{for} \ n = 1, 2, \ldots 1994, \] and \[ 2\sqrt{a_{1995} - 1994} \geq a_1 + 1. \]
Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$, the digits in the base-$2n$ representation of $n^k$ are all greater than $d$.
Given two internally tangent circles; in the bigger one we inscribe an equilateral triangle. From each of the vertices of this triangle, we draw a tangent to the smaller circle. Prove that the length of one of these tangents equals the sum of the lengths of the two other tangents.
Find all complex numbers $z$ such that $|z^3+2-2i|+z\overline z|z|=2\sqrt2.$
Let $ABC$ be an isosceles triangle with $AB = AC$. Suppose $P,Q,R$ are points on segments $AC, AB, BC$ respectively such that $AP = QB$, $\angle PBC = 90^\circ - \angle BAC$ and $RP = RQ$. Let $O_1, O_2$ be the circumcenters of $\triangle APQ$ and $\triangle CRP$. Prove that $BR = O_1O_2$.
[i]Proposed by Atul Shatavart Nadig[/i]
4) find all polynom with coeffs a permutation of $[1,...,n]$ and all roots rational
Determine the maximal value of $k$ such that the inequality
$$\left(k +\frac{a}{b}\right) \left(k + \frac{b}{c}\right)\left(k + \frac{c}{a}\right)
\le \left( \frac{a}{b}+ \frac{b}{c}+ \frac{c}{a}\right) \left( \frac{b}{a}+ \frac{c}{b}+ \frac{a}{c}\right)$$
holds for all positive reals $a, b, c$.
Solve the following equation in integers with gcd (x, y) = 1
$x^2 + y^2 = 2 z^2$
A function $f(S)$ assigns to each nine-element subset of $S$ of the set $\{1,2,\ldots, 20\}$ a whole number from $1$ to $20$. Prove that regardless of how the function $f$ is chosen, there will be a ten-element subset $T\subset\{1,2,\ldots, 20\}$ such that $f(T - \{k\})\neq k$ for all $k\in T$.
Which of the following claims are true, and which of them are false? If a fact is true you should prove it, if it isn't, find a counterexample.
a) Let $a,b,c$ be real numbers such that $ a^{2013} + b^{2013} + c^{2013} = 0 $. Then $ a^{2014} + b^{2014} + c^{2014} = 0 $.
b) Let $a,b,c$ be real numbers such that $ a^{2014} + b^{2014} + c^{2014} = 0 $. Then $ a^{2015} + b^{2015} + c^{2015} = 0 $.
c) Let $a,b,c$ be real numbers such that $ a^{2013} + b^{2013} + c^{2013} = 0 $ and $ a^{2015} + b^{2015} + c^{2015} = 0 $. Then $ a^{2014} + b^{2014} + c^{2014} = 0 $.
[i]Proposed by Matko Ljulj[/i]
Integers $1 \le n \le 200$ are written on a blackboard just one by one. We surrounded just $100$ integers with circle. We call a square of the sum of surrounded integers minus the sum of not surrounded integers $score$ of this situation. Calculate the average score in all ways.
Let $x,y,z\in \mathbb{R}^*$ such that $xy,yz,zx\in \mathbb{Q}$.
a) Prove that $x^2+y^2+z^2$ is rational;
b) If $x^3+y^3+z^3$ is rational, prove that $x,y,z$ are rational.
[i]Marius Ghergu[/i]
The positive integer-valued function $f(n)$ satisfies $f(f(n)) = 4n$ and $f(n + 1) > f(n) > 0$ for all positive integers $n$. Compute the number of possible 16-tuples $(f(1), f(2), f(3), \dots, f(16))$.
[i]Proposed by Lewis Chen[/i]
The sum $\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}=\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$
Without using a calculator, determine which number is greater: $17^{24}$ or $31^{19}$
Prove that
$$\lim_{n\to\infty}n^2\left(\int^1_0\sqrt[n]{1+x^n}\text dx-1\right)=\frac{\pi^2}{12}.$$
If $3x^3-9x^2+kx-12$ is divisible by $x-3$, then it is also divisible by:
${{ \textbf{(A)}\ 3x^2-x+4 \qquad\textbf{(B)}\ 3x^2-4 \qquad\textbf{(C)}\ 3x^2+4 \qquad\textbf{(D)}\ 3x-4 }\qquad\textbf{(E)}\ 3x+4 } $
Let $A_1, A_2, A_3, \ldots , A_{12}$ be the vertices of a regular $12-$gon (dodecagon). Find the number of points in the plane that are equidistant to at least $3$ distinct vertices of this $12-$gon.
There are seven piles with $2014$ pebbles each and a pile with $2008$ pebbles. Ana and Beto play in turns and Ana always plays first. One move consists of removing pebbles from all the piles. From each pile is removed a different amount of pebbles, between $1$ and $8$ pebbles. The first player who cannot make a move loses.
a) Who has a winning strategy?
b) If there were seven piles with $2015$ pebbles each and a pile with $2008$ pebbles, who has a winning strategy?
There are $90$ cards and two different digits are written on each one: $01$, $02$, $03$, $04$, $05$, $06$, $07$, $08$, $09$, $10$, $12$, and so on up to $98$. A set of cards is [i]correct [/i]if it does not contain any cards whose first digit is the same as the second digit of another card in the set. We call the [i]value [/i]of a set of cards the sum of the numbers written on each card. For example, the four cards $04$, $35$, $78$ and $98$ form a correct set and their value is $215$, since$ 04+35+78+98=215$. Find a correct set that has the largest possible value. Explain why it is impossible to achieve a correct set of higher value.
10. Let $p=47$ be a prime. Call a function $f$ defined on the integers [i]lit[/i] if $f(x)$ is an integer from 1 to $p$ inclusive and $f(x+p)=f(x)$ for all integers $x$. How many [i]lit[/i] functions $g$ are there such that for all integers $x$, $p$ divides $g(x^2)-g(x)-x^8+x$?
[i]Proposed by Monkey_king1[/i]
Compute the unique five-digit positive integer $\underline{abcde}$ such that $a \neq 0, c \neq 0,$ and $$\underline{abcde}=(\underline{ab}+\underline{cde})^2.$$
What is the largest quotient that can be formed using two numbers chosen from the set $\{ -24, -3, -2, 1, 2, 8 \}$?
$\text{(A)}\ -24 \qquad \text{(B)}\ -3 \qquad \text{(C)}\ 8 \qquad \text{(D)}\ 12 \qquad \text{(E)}\ 24$
The target below is made up of concentric circles with diameters $4$, $8$, $12$, $16$, and $20$. The area of the dark region is $n\pi$. Find $n$.
[asy]
size(150);
defaultpen(linewidth(0.8));
int i;
for(i=5;i>=1;i=i-1)
{
if (floor(i/2)==i/2)
{
filldraw(circle(origin,4*i),white);
}
else
{
filldraw(circle(origin,4*i),red);
}
}
[/asy]