In the $xy$-plane, consider the L-shaped region bounded by horizontal and vertical segments with vertices at $(0,0), (0,3), (3,3), (3,1), (5,1)$ and $(5,0)$. The slope of the line through the origin that divides the area of this region exactly in half is [asy] size(200); Label l; l.p=fontsize(6); xaxis("$x$",0,6,Ticks(l,1.0,0.5),EndArrow); yaxis("$y$",0,4,Ticks(l,1.0,0.5),EndArrow); draw((0,3)--(3,3)--(3,1)--(5,1)--(5,0)--(0,0)--cycle,black+linewidth(2));[/asy] $ \textbf{(A)}\ \frac{2}{7} \qquad\textbf{(B)}\ \frac{1}{3} \qquad\textbf{(C)}\ \frac{2}{3} \qquad\textbf{(D)}\ \frac{3}{4} \qquad\textbf{(E)}\ \frac{7}{9} $

A regular hexagon is inscribed in a circle. The ratio of the length of a side of the hexagon to the length of the shorter of the arcs intercepted by the side, is: $ \textbf{(A)}\ 1: 1 \qquad \textbf{(B)}\ 1: 6 \qquad \textbf{(C)}\ 1: \pi \qquad \textbf{(D)}\ 3: \pi \qquad \textbf{(E)}\ 6: \pi$

The integer part $I (A)$ of a number $A$ is the greatest integer which is not greater than $A$ , while the fractional part $F(A)$ is defined as $A - I(A)$ . (a) Give an example of a positive number $A$ such that $F(A) + F( 1/A) = 1$ . (b) Can such an $A$ be a rational number? (I. Varge, Romania)

Each morning of her five-day workweek, Jane bought either a $ 50$-cent muffin or a $ 75$-cent bagel. Her total cost for the week was a whole number of dollars. How many bagels did she buy? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Find all $10$-digit whole numbers $N$, such that first $10$ digits of $N^2$ coincide with the digits of $N$ (in the same order).

We are given an acute triangle $ABC$ with $AB\neq AC$. Let $D$ be a point of $BC$ such that $DA$ is tangent to the circumcircle of $ABC$. Let $E$ and $F$ be the circumcenters of triangles $ABD$ and $ACD$, respectively, and let $M$ be the midpoints $EF$. Prove that the line tangent to the circumcircle of $AMD$ through $D$ is also tangent to the circumcircle of $ABC$. [i]Proposed by Patrik Bak, Slovakia[/i]

Square table $5 \times 5$ is filled with numbers in a following way. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYi8zLzQ0Y2M1NjdiNjQ3NjhlYTAwMWQ0MTg2ZjIwZWE4NzkwYzcwYWFkLnBuZw==&rn=dGFiZWxpY2EucG5n[/img] We can change the table in a way we take two arbitrary numbers from the table and we decrease both of them with value of smaller of those two. Can we get to the table with all zeros?

Problem 19 The diagram below shows a 24×24 square ABCD. Points E and F lie on sides AD and CD, respectively, so that DE = DF = 8. Set X consists of the shaded triangle ABC with its interior, while set Y consists of the shaded triangle DEF with its interior. Set Z consists of all the points that are midpoints of segments connecting a point in set X with a point in set Y . That is, Z = {z | z is the midpoint of xy for x ∈ X and y ∈ Y}. Find the area of the set Z. For diagram to http://www.purplecomet.org/welcome/practice

Let $ ABC$ be an acute-angled, non-isosceles triangle with orthocenter $H$, $M$ midpoint of side $AB$ and $w$ bisector of angle $\angle ACB$. Let $S$ be the point of intersection of the perpendicular bisector of side $AB$ with $w$ and $F$ the foot of the perpendicular from $H$ on $w$. Prove that the segments $MS$ and $MF$ are equal. [i](Karl Czakler)[/i]

Circle I passes through the center of, and is tangent to, circle II. The area of circle I is 4 square inches. Then the area of circle II, in square inches, is: $ \textbf{(A) }8\qquad\textbf{(B) }8\sqrt{2}\qquad\textbf{(C) }8\sqrt{\pi}\qquad\textbf{(D) }16\qquad\textbf{(E) }16\sqrt{2} $

Let $s(n)$ be the number of positive integer divisors of $n$. Find the all positive values of $k$ that is providing $k=s(a)=s(b)=s(2a+3b)$.

a) Is it possible to place $2024$ checkers on a board $70 \times 70$ so that any square $2 \times 2$ contains even number of checkers? b) Is it possible to place $2023$ checkers on a board $70 \times 70$ so that any square $2 \times 2$ contains odd number of checkers?

There are $n\ge 3$ girls in a class sitting around a circular table, each having some apples with her. Every time the teacher notices a girl having more apples than both of her neighbours combined, the teacher takes away one apple from that girl and gives one apple each to her neighbours. Prove that, this process stops after a finite number of steps. (Assume that, the teacher has an abundant supply of apples.)

i thought that this problem was in mathlinks but when i searched i didn't find it.so here it is: Find all positive integers m for which for all $\alpha,\beta \in \mathbb{Z}-\{0\}$ \[ \frac{2^m \alpha^m-(\alpha+\beta)^m-(\alpha-\beta)^m}{3 \alpha^2+\beta^2} \in \mathbb{Z} \]

Does there exist positive integers $a, b, c$ such that $4(ab - a - c^2) = b$?

On a unit circle with center $O$, $AB$ is an arc with the central angle $\alpha<90^\circ$. Point $H$ is the foot of the perpendicular from $A$ to $OB$, $T$ is a point on arc $AB$, and $l$ is the tangent to the circle at $T$. The line $l$ and the angle $AHB$ form a triangle $\Delta$. (a) Prove that the area of $\Delta$ is minimal when $T$ is the midpoint of arc $AB$. (b) Prove that if $S_\alpha$ is the minimal area of $\Delta$ then the function $\frac{S_\alpha}\alpha$ has a limit when $\alpha\to0$ and find this limit.

Let $n > 0$ be an integer. We are given a balance and $n$ weights of weight $2^0, 2^1, \cdots, 2^{n-1}$. We are to place each of the $n$ weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed. Determine the number of ways in which this can be done. [i]Proposed by Morteza Saghafian, Iran[/i]

Let $ f_m: \mathbb R \to \mathbb R$, $ f_m(x)\equal{}(m^2\plus{}m\plus{}1)x^2\minus{}2(m^2\plus{}1)x\plus{}m^2\minus{}m\plus{}1,$ where $ m \in \mathbb R$. 1) Find the fixed common point of all this parabolas. 2) Find $ m$ such that the distance from that fixed point to $ Oy$ is minimal.

Find the minimum value of $\sqrt{58-42x}+\sqrt{149-140\sqrt{1-x^2}}$ where $-1 \le x \le 1$.

Let's consider all possible quadratic trinomials of the form $x^2 + ax + b$, where $a$ and $b$ are positive integers not exceeding some positive integer $N$. Prove that the number of pairs of such trinomials having a common root does not exceed $N^2$.

[b]1.[/b] Let $C_{ij}$ ($i,j=1,2,3$) be the coefficients of a real non-involutive orthogonal transformation. Prove that the function $w= \sum_{i,j=1}^{3} c_{ ij}z_{i}\bar{z_{ j}}$ maps the surface of complex unit sphere $\sum_{i=1}^{3} z_{i}\bar{z_{i}} = 1$ onto a triangle of the w-plane. [b](F. 3)[/b]

Let be a function $ s:\mathbb{N}^2\longrightarrow \mathbb{N} $ that sends $ (m,n) $ to the number of solutions in $ \mathbb{N}^n $ of the equation: $$ x_1+x_2+\cdots +x_n=m $$ [b]1)[/b] Prove that: $$ s(m+1,n+1)=s(m,n)+s(m,n+1) =\prod_{r=1}^n\frac{m-r+1}{r} ,\quad\forall m,n\in\mathbb{N} $$ [b]2)[/b] Find $ \max\left\{ a_1a_2\cdots a_{20}\bigg| a_1+a_2+\cdots +a_{20}=2007, a_1,a_2,\ldots a_{20}\in\mathbb{N} \right\} . $

Given a positive integer $n$, consider the sequence $(a_i)$, $1 \leq i \leq 2n$, defined as follows: $a_{2k-1} = -k, 1 \leq k \leq n$ $a_{2k} = n-k+1, 1 \leq k \leq n.$ We call a pair of numbers $(b,c)$ good if the following conditions are met: $i) 1 \leq b < c \leq 2n,$ $ii) \sum_{j=b}^{c}a_j = 0$ If $B(n)$ is the number of good pairs corresponding to $n$, prove that there are infinitely many $n$ for which $B(n) = n$.

Let $ABC$ be an acute-angled triangle and let $P$ be the intersection of the tangents at $B$ and $C$ of the circumscribed circle of $\vartriangle ABC$. The line through $A$ perpendicular on $AB$ and cuts the line perpendicular on $AC$ through $C$ at $X$. The line through $A$ perpendicular on $AC$ cuts the line perpendicular on $AB$ through $B$ at $Y$. Show that $AP \perp XY$.

[b]p1.[/b] Find all $x$ such that $(\ln (x^4))^2 = (\ln (x))^6$. [b]p2.[/b] On a piece of paper, Alan has written a number $N$ between $0$ and $2010$, inclusive. Yiwen attempts to guess it in the following manner: she can send Alan a positive number $M$, which Alan will attempt to subtract from his own number, which we will call $N$. If $M$ is less than or equal $N$, then he will erase $N$ and replace it with $N -M$. Otherwise, Alan will tell Yiwen that $M > N$. What is the minimum number of attempts that Yiwen must make in order to determine uniquely what number Alan started with? [b]p3.[/b] How many positive integers between $1$ and $50$ have at least $4$ distinct positive integer divisors? (Remember that both $1$ and $n$ are divisors of $n$.) [b]p4.[/b] Let $F_n$ denote the $n^{th}$ Fibonacci number, with $F_0 = 0$ and $F_1 = 1$. Find the last digit of $$\sum^{97!+4}_{i=0}F_i.$$ [b]p5.[/b] Find all prime numbers $p$ such that $2p + 1$ is a perfect cube. [b]p6.[/b] What is the maximum number of knights that can be placed on a $9\times 9$ chessboard such that no two knights attack each other? [b]p7.[/b] $S$ is a set of $9$ consecutive positive integers such that the sum of the squares of the $5$ smallest integers in the set is the sum of the squares of the remaining $4$. What is the sum of all $9$ integers? [b]p8.[/b] In the following infinite array, each row is an arithmetic sequence, and each column is a geometric sequence. Find the sum of the infinite sequence of entries along the main diagonal. [img]https://cdn.artofproblemsolving.com/attachments/5/1/481dd1e496fed6931ee2912775df630908c16e.png[/img] [b]p9.[/b] Let $x > y > 0$ be real numbers. Find the minimum value of $\frac{x}{y} + \frac{4x}{x-y}$ . [b]p10.[/b] A regular pentagon $P = A_1A_2A_3A_4A_5$ and a square $S = B_1B_2B_3B_4$ are both inscribed in the unit circle. For a given pentagon $P$ and square $S$, let $f(P, S)$ be the minimum length of the minor arcs $A_iB_j$ , for $1 \le i \le 5$ and $1 \le j \le4$. Find the maximum of $f(P, S)$ over all pairs of shapes. [b]p11.[/b] Find the sum of the largest and smallest prime factors of $9^4 + 3^4 + 1$. [b]p12.[/b] A transmitter is sending a message consisting of $4$ binary digits (either ones or zeros) to a receiver. Unfortunately, the transmitter makes errors: for each digit in the message, the probability that the transmitter sends the correct digit to the receiver is only $80\%$. (Errors are independent across all digits.) To avoid errors, the receiver only accepts a message if the sum of the first three digits equals the last digit modulo $2$. If the receiver accepts a message, what is the probability that the message was correct? [b]p13.[/b] Find the integer $N$ such that $$\prod^{8}_{i=0}\sec \left( \frac{\pi}{9}2^i \right)= N.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].