Found problems: 85335
for a positive integer $n$, there are positive integers $a_1, a_2, ... a_n$ that satisfy these two.
(1) $a_1=1, a_n=2020$
(2) for all integer $i$, $i$satisfies $2\leq i\leq n, a_i-a_{i-1}=-2$ or $3$.
find the greatest $n$
For any positive integer $n$ let $s(n)$ be the sum of its digits in decimal representation. Find all numbers $n$ for which $s(n)$ is the largest proper divisor of $n$.
There is a $8*8$ board and the numbers $1,2,3,4,...,63,64$. In all the unit squares of the board, these numbers are places such that only $1$ numbers goes to only one unit square. Prove that there is atleast $4$ $2*2$ squares such that the sum of the numbers in $2*2$ is greater than $100$.
Let $ABC$ be a triangle, and let $D$ be a point on the internal angle bisector of $BAC$. Let $x$ be the ellipse with foci $B$ and $C$ passing through $D$, $y$ be the ellipse with foci $A$ and $C$ passing through $D$, and $z$ be the ellipse with foci $A$ and $B$ passing through $D$. Ellipses $x$ and $z$ intersect at distinct points $D$ and $E$, and ellipses $x$ and $y$ intersect at distinct points $D$ and $F$. Prove that $AD$ bisects angle $EAF$.
[i]Andrew Carratu[/i]
The point $M$ varies on the segment $AB$ that measures $2$ m.
a) Find the equation and the graphical representation of the locus of the points of the plane whose coordinates, $x$, and $y$, are, respectively, the areas of the squares of sides $AM$ and $MB$ .
b) Find out what kind of curve it is. (Suggestion: make a $45^o$ axis rotation).
c) Find the area of the enclosure between the curve obtained and the coordinate axes.
Let $ABC$ be an acute-angled triangle with $AB < AC$. Let $\Omega$ be the circumcircle of $ABC$. Let $S$ be the midpoint of the arc $CB$ of $\Omega$ containing $A$. The perpendicular from $A$ to $BC$ meets $BS$ at $D$ and meets $\Omega$ again at $E \neq A$. The line through $D$ parallel to $BC$ meets line $BE$ at $L$. Denote the circumcircle of triangle $BDL$ by $\omega$. Let $\omega$ meet $\Omega$ again at $P \neq B$. Prove that the line tangent to $\omega$ at $P$ meets line $BS$ on the internal angle bisector of $\angle BAC$.
In a $10$ by $10$ square grid (which we call “the bay”) you are requested to place ten “ships”: one $1$ by $4$ ship, two $1$ by $3$ ships, three $1$ by $2$ ships and four $1$ by $1$ ships. The ships may not have common points (even corners) but may touch the “shore” of the bay. Prove that
(a) by placing the ships one after the other arbitrarily but in the order indicated above, it is always possible to complete the process;
(b) by placing the ships in reverse order (beginning with the smaller ones), it is possible to reach a situation where the next ship cannot be placed (give an example).
(KN Ignatjev)
Palmer correctly computes the product of the first $1,001$ prime numbers. Which of the following is NOT a factor of Palmer's product?
$\text{(A) }2,002\qquad\text{(B) }3,003\qquad\text{(C) }5,005\qquad\text{(D) }6,006\qquad\text{(E) }7,007$
Let $\Gamma(s)$ denote Euler's gamma function. Construct an even entire function $F(s)$ that does not vanish everywhere, for which the quotient $F(s)/\Gamma(s)$ is bounded on the right halfplane $\{\Re(s)>0\}$.
What is the area of the shaded figure shown below?
[asy]
size(200);
defaultpen(linewidth(0.4)+fontsize(12));
pen s = linewidth(0.8)+fontsize(8);
pair O,X,Y;
O = origin;
X = (6,0);
Y = (0,5);
fill((1,0)--(3,5)--(5,0)--(3,2)--cycle, palegray+opacity(0.2));
for (int i=1; i<7; ++i)
{
draw((i,0)--(i,5), gray+dashed);
label("${"+string(i)+"}$", (i,0), 2*S);
if (i<6)
{
draw((0,i)--(6,i), gray+dashed);
label("${"+string(i)+"}$", (0,i), 2*W);
}
}
label("$0$", O, 2*SW);
draw(O--X+(0.15,0), EndArrow);
draw(O--Y+(0,0.15), EndArrow);
draw((1,0)--(3,5)--(5,0)--(3,2)--(1,0), black+1.5);
[/asy]
Let $N$ be the number of (positive) divisors of $2010^{2010}$ ending in the digit $2$. What is the remainder when $N$ is divided by 2010?
Alice knows that $3$ red cards and $3$ black cards will be revealed to her one at a time in random order. Before each card is revealed, Alice must guess its color. If Alice plays optimally, the expected number of cards she will guess correctly is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Let $x$ and $y$ are real numbers such that $x^2y^2+2yx^2+1=0.$ If $S=\frac{2}{x^2}+1+\frac{1}{x}+y(y+2+\frac{1}{x})$, find
(a)max$S$ and
(b) min$S$.
Let $p$ be an odd prime. Without using Dirichlet's theorem, show that there are infinitely many primes of the form $2pk+1$.
Show that the number of $3-$element subsets $\{ a , b, c \}$ of $\{ 1 , 2, 3, \ldots, 63 \}$ with $a+b +c < 95$ is less than the number of those with $a + b +c \geq 95.$
Positive integers $a, b,$ and $c$ have the property that $\text{lcm}(a,b), \text{lcm}(b,c),$ and $\text{lcm}(c,a)$ end in $4, 6,$ and $7,$ respectively, when written in base $10.$ Compute the minimum possible value of $a + b + c.$
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all real numbers $x$ and $y$,
$$f(f(x-y)-yf(x))=xf(y).$$
Let $ABC$ be a triangle with $\angle B > \angle C$. Let $P$ and $Q$ be two different points on line $AC$ such that $\angle PBA = \angle QBA = \angle ACB $ and $A$ is located between $P$ and $C$. Suppose that there exists an interior point $D$ of segment $BQ$ for which $PD=PB$. Let the ray $AD$ intersect the circle $ABC$ at $R \neq A$. Prove that $QB = QR$.
The figure below shows $13$ circles of radius $1$ within a larger circle. All the intersections occur at points of tangency. What is the area of the region, shaded in the figure, inside the larger circle but outside all the circles of radius $1 ?$
[asy]unitsize(20);filldraw(circle((0,0),2*sqrt(3)+1),rgb(0.5,0.5,0.5));filldraw(circle((-2,0),1),white);filldraw(circle((0,0),1),white);filldraw(circle((2,0),1),white);filldraw(circle((1,sqrt(3)),1),white);filldraw(circle((3,sqrt(3)),1),white);filldraw(circle((-1,sqrt(3)),1),white);filldraw(circle((-3,sqrt(3)),1),white);filldraw(circle((1,-1*sqrt(3)),1),white);filldraw(circle((3,-1*sqrt(3)),1),white);filldraw(circle((-1,-1*sqrt(3)),1),white);filldraw(circle((-3,-1*sqrt(3)),1),white);filldraw(circle((0,2*sqrt(3)),1),white);filldraw(circle((0,-2*sqrt(3)),1),white);[/asy]
$\textbf{(A) } 4 \pi \sqrt{3} \qquad\textbf{(B) } 7 \pi \qquad\textbf{(C) } \pi(3\sqrt{3} +2) \qquad\textbf{(D) } 10 \pi (\sqrt{3} - 1) \qquad\textbf{(E) } \pi(\sqrt{3} + 6)$
A teacher suggests four possible books for students to read. Each of six students selects one of the four books. How many ways can these selections be made if each of the books is read by at least one student?
In trapezoid $ABCD$, the diagonals intersect at $E$, the area of $\triangle ABE$ is 72 and the area of $\triangle CDE$ is 50. What is the area of trapezoid $ABCD$?
Find all triangles with integer sidelenghts such that their perimeter and area are equal.
Let $m,k,n$ be positive integers. Determine all triples $(m,k,n)$ satisfying the following equation:
$3^m5^k=n^3+125$
For each $k$ , find the least $n$ in terms of $k$ st the following holds:
There exists $n$ real numbers $a_1 , a_2 ,\cdot \cdot \cdot , a_n$ st for each $i$ :
$$0 < a_{i+1} - a_{i} < a_i - a_{i-1}$$
And , there exists $k$ pairs $(i,j)$ st $a_i - a_j = 1$.
Let us name a move of the chess knight horizontal if it moves two cells horizontally and one vertically, and vertical otherwise. It is required to place the knight on a cell of a ${46} \times {46}$ board and alternate horizontal and vertical moves. Prove that if each cell is visited not more than once then the number of moves does not exceed 2024.
Alexandr Gribalko