Prove that there is a function $ F:\mathbb{N}\longrightarrow\mathbb{N} $ satisfying $ (F\circ F) (n) =n^2, $ for all $ n\in\mathbb{N} . $

Let $\alpha, \beta$ be real numbers such that $\sin\alpha\sin\beta=\frac{1}{3}$. Prove that the set of possible values of $\cos \alpha \cos \beta$ is the interval $\left[-\frac{2}{3}, \frac{2}{3}\right]$.

A real number $\alpha$ is given. Find all functions $f : R^+ \to R^+$ satisfying $\alpha x^2f\left(\frac{1}{x}\right) +f(x) =\frac{x}{x+1}$ for all $x > 0$.

Let $d$ be a positive integer. The seqeunce $a_1, a_2, a_3,...$ of positive integers is defined by $a_1 = 1$ and $a_{n + 1} = n\left \lfloor \frac{a_n}{n} \right \rfloor+ d$ for $n = 1,2,3, ...$ . Prove that there exists a positive integer $N$ so that the terms $a_N,a_{N + 1}, a_{N + 2},...$ form an arithmetic progression. Note: If $x$ is a real number, $\left \lfloor x \right \rfloor $ denotes the largest integer that is less than or equal to $x$.

Given natural numbers $x_1,x_2,...,x_n,y_1,y_2,...,y_m$. The following condition is valid: $$(x_1+x_2+...+x_n)=(y_1+y_2+...+y_m)<mn \,\,\,\, (*)$$ Prove that it is possible to delete some terms from (*) (not all and at least one) and to obtain another valid condition.

Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$

Calculate the sum $$\frac{1}{1+2^{-2006}}+...+ \frac{1}{1+2^{-1}}+ \frac{1}{1+2^{0}}+ \frac{1}{1+2^{1}}+...+ \frac{1}{1+2^{2006}}$$

Find all non constant polynomials $P(x),Q(x)$ with real coefficients such that: $P((Q(x))^3)=xP(x)(Q(x))^3$

Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.

[b]p1.[/b] Susan plays a game in which she rolls two fair standard six-sided dice with sides labeled one through six. She wins if the number on one of the dice is three times the number on the other die. If Susan plays this game three times, compute the probability that she wins at least once. [b]p2.[/b] In triangles $\vartriangle ABC$ and $\vartriangle DEF$, $DE = 4AB$, $EF = 4BC$, and $FD = 4CA$. The area of $\vartriangle DEF$ is $360$ units more than the area of $\vartriangle ABC$. Compute the area of $\vartriangle ABC$. [b]p3.[/b] Andy has $2010$ square tiles, each of which has a side length of one unit. He plans to arrange the tiles in an $m\times n$ rectangle, where $mn = 2010$. Compute the sum of the perimeters of all of the different possible rectangles he can make. Two rectangles are considered to be the same if one can be rotated to become the other, so, for instance, a $1\times 2010$ rectangle is considered to be the same as a $2010\times 1$ rectangle. [b]p4.[/b] Let $$S = \log_2 9 \log_3 16 \log_4 25 ... \log_{999} 1000000.$$ Compute the greatest integer less than or equal to $\log_2 S$. [b]p5.[/b] Let $A$ and $B$ be fixed points in the plane with distance $AB = 1$. An ant walks on a straight line from point $A$ to some point $C$ in the plane and notices that the distance from itself to B always decreases at any time during this walk. Compute the area of the region in the plane containing all points where point $C$ could possibly be located. [b]p6.[/b] Lisette notices that $2^{10} = 1024$ and $2^{20} = 1 048 576$. Based on these facts, she claims that every number of the form $2^{10k}$ begins with the digit $1$, where k is a positive integer. Compute the smallest $k$ such that Lisette's claim is false. You may or may not find it helpful to know that $ln 2 \approx 0.69314718$, $ln 5 \approx 1.60943791$, and $log_{10} 2 \approx 0:30103000$. [b]p7.[/b] Let $S$ be the set of all positive integers relatively prime to $6$. Find the value of $\sum_{k\in S}\frac{1}{2^k}$ . [b]p8.[/b] Euclid's algorithm is a way of computing the greatest common divisor of two positive integers $a$ and $b$ with $a > b$. The algorithm works by writing a sequence of pairs of integers as follows. 1. Write down $(a, b)$. 2. Look at the last pair of integers you wrote down, and call it $(c, d)$. $\bullet$ If $d \ne 0$, let r be the remainder when c is divided by d. Write down $(d, r)$. $\bullet$ If $d = 0$, then write down c. Once this happens, you're done, and the number you just wrote down is the greatest common divisor of a and b. 3. Repeat step 2 until you're done. For example, with $a = 7$ and $b = 4$, Euclid's algorithm computes the greatest common divisor in $4$ steps: $$(7, 4) \to (4, 3) \to (3, 1) \to (1, 0) \to 1$$ For $a > b > 0,$ compute the least value of a such that Euclid's algorithm takes $10$ steps to compute the greatest common divisor of $a$ and $b$. [b]p9.[/b] Let $ABCD$ be a square of unit side length. Inscribe a circle $C_0$ tangent to all of the sides of the square. For each positive integer $n$, draw a circle Cn that is externally tangent to $C_{n-1}$ and also tangent to sides $AB$ and $AD$. Suppose $r_i$ is the radius of circle $C_i$ for every nonnegative integer $i$. Compute $\sqrt[200]{r_0/r_{100}}$. [b]p10.[/b] Rachel and Mike are playing a game. They start at $0$ on the number line. At each positive integer on the number line, there is a carrot. At the beginning of the game, Mike picks a positive integer $n$ other than $30$. Every minute, Rachel moves to the next multiple of $30$ on the number line that has a carrot on it and eats that carrot. At the same time, every minute, Mike moves to the next multiple of $n$ on the number line that has a carrot on it and eats that carrot. Mike wants to pick an $n$ such that, as the game goes on, he is always within $1000$ units of Rachel. Compute the average (arithmetic mean) of all such $n$. [b]p11.[/b] Darryl has a six-sided die with faces $1, 2, 3, 4, 5, 6$. He knows the die is weighted so that one face comes up with probability $1/2$ and the other five faces have equal probability of coming up. He unfortunately does not know which side is weighted, but he knows each face is equally likely to be the weighted one. He rolls the die 5 times and gets a $1$, $2$, $3$, $4$ and $5$ in some unspecified order. Compute the probability that his next roll is a $6$. [b]p12.[/b] Let $F_0 = 1$, $F_1 = 1$ and $F_k = F_{k-1} + F_{k-2}$. Let $P(x) =\sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$. [b]p13.[/b] Let $\theta \ne 0$ be the smallest acute angle for which $\sin \theta$, $\sin (2\theta)$, $\sin (3\theta)$, when sorted in increasing order, form an arithmetic progression. Compute $\cos (\theta/2)$. [b]p14.[/b] A $4$-dimensional hypercube of edge length 1 is constructed in $4$-space with its edges parallel to the coordinate axes and one vertex at the origin. The coordinates of its sixteen vertices are given by $(a, b, c, d)$, where each of $a$, $b$, $c$, and $d$ is either $0$ or $1$. The $3$-dimensional hyperplane given by $x + y + z + w = 2$ intersects the hypercube at $6$ of its vertices. Compute the $3$-dimensional volume of the solid formed by the intersection. [b]p15.[/b] A student puts $2010$ red balls and $1957$ blue balls into a box. Weiqing draws randomly from the box one ball at a time without replacement. She wins if, at anytime, the total number of blue balls drawn is more than the total number of red balls drawn. Assuming Weiqing keeps drawing balls until she either wins or runs out, ompute the probability that she eventually wins. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For which $n\ge 3$ does there exist positive integers $a_1<a_2<\cdots <a_n$, such that: $$a_n=a_1+...+a_{n-1}, \hspace{0.5cm} \frac{1}{a_1}=\frac{1}{a_2}+...+\frac{1}{a_n}$$ are both true? [i]Proposed by Ivan Chan Kai Chin[/i]

Find all pairs of integers $(x, y)$ satisfying the equality \[y(x^{2}+36)+x(y^{2}-36)+y^{2}(y-12)=0.\]

Find the number of ordered pairs $(x,y)$, where both $x$ and $y$ are integers between $-100$ and $100$ inclusive, such that $12x^2-xy-6y^2=0$.

Let $d$ and $m$ be two fixed positive integers. Pinocchio and Geppetto know the values of $d$ and $m$ and play the following game: In the beginning, Pinocchio chooses a polynomial $P$ of degree at most $d$ with integer coefficients. Then Geppetto asks him questions of the following form "What is the value of $P(n)$?'' for $n \in \mathbb{Z}$. Pinocchio usually says the truth, but he can lie up to $m$ times. What is, as a function of $d$ and $m$, the minimal number of questions that Geppetto needs to ask to be sure to determine $P$, no matter how Pinocchio chooses to reply?

Let $p$ and $q$ be different prime numbers. Solve the following system in integers: \[\frac{z+ p}x+\frac{z-p}y= q,\\ \frac{z+ p}y -\frac{z-p}x= q.\]

Discriminants of square trinomials $f(x),g(x),h(x),f(x)+g(x),f(x)+h(x),g(x)+h(x)$ equals $1$. Prove that $f(x)+h(x)+g(x) \equiv 0$

Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$. [i]Alternative formulation[/i]: Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial \[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}. \] Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$ [i]Proposed by Federico Ardila, Colombia[/i]

Find all pairs of real numbers $(x, y) $ such that: a) $x\ge y\ge1$ b) $2x^2-xy-5x +y + 4 = 0 $

$a_1\geq a_2\geq... \geq a_{100n}>0$ If we take from $(a_1,a_2,...,a_{100n})$ some $2n+1$ numbers $b_1\geq b_2 \geq ... \geq b_{2n+1}$ then $b_1+...+b_n > b_{n+1}+...b_{2n+1}$ Prove, that $$(n+1)(a_1+...+a_n)>a_{n+1}+a_{n+2}+...+a_{100n}$$

The sequence $(a_n)$ is defined as: $$a_1=1007$$ $$a_{i+1}\geq a_i+1$$ Prove the inequality: $$\frac{1}{2016}>\sum_{i=1}^{2016}\frac{1}{a_{i+1}^{2}+a_{i+2}^2}$$

Prove that $$\frac{2}{2!}+\frac{7}{3!}+\frac{14}{4!}+\frac{23}{5!}+...+\frac{k^2-2}{k!}+...+\frac{9998}{100!}<3$$ where $n! = 1 \times 2 \times ... \times n.$ (V Senderov)

For integers a, b, c, and d the polynomial $p(x) =$ $ax^3 + bx^2 + cx + d$ satisfies $p(5) + p(25) = 1906$. Find the minimum possible value for $|p(15)|$.

The positive numbers $a_1, a_2, \ldots , a_{2024}$ are placed on a circle clockwise in this order. Let $A_i$ be the arithmetic mean of the number $a_i$ and one or several following it clockwise. Prove that the largest of the numbers $A_1, A_2, \ldots , A_{2024}$ is not less than the arithmetic mean of all numbers $a_1, a_2, \ldots , a_{2024}$.

[b]p1.[/b] Let $X = 2022 + 022 + 22 + 2$. When $X$ is divided by $22$, there is a remainder of $R$. What is the value of $R$? [b]p2.[/b] When Amy makes paper airplanes, her airplanes fly $75\%$ of the time. If her airplane flies, there is a $\frac56$ chance that it won’t fly straight. Given that she makes $80$ airplanes, what is the expected number airplanes that will fly straight? [b]p3.[/b] It takes Joshua working alone $24$ minutes to build a birdhouse, and his son working alone takes $16$ minutes to build one. The effective rate at which they work together is the sum of their individual working rates. How long in seconds will it take them to make one birdhouse together? [b]p4.[/b] If Katherine’s school is located exactly $5$ miles southwest of her house, and her soccer tournament is located exactly $12$ miles northwest of her house, how long, in hours, will it take Katherine to bike to her tournament right after school given she bikes at $0.5$ miles per hour? Assume she takes the shortest path possible. [b]p5.[/b] What is the largest possible integer value of $n$ such that $\frac{4n+2022}{n+1}$ is an integer? [b]p6.[/b] A caterpillar wants to go from the park situated at $(8, 5)$ back home, located at $(4, 10)$. He wants to avoid routes through $(6, 7)$ and $(7, 10)$. How many possible routes are there if the caterpillar can move in the north and west directions, one unit at a time? [b]p7.[/b] Let $\vartriangle ABC$ be a triangle with $AB = 2\sqrt{13}$, $BC = 6\sqrt2$. Construct square $BCDE$ such that $\vartriangle ABC$ is not contained in square $BCDE$. Given that $ACDB$ is a trapezoid with parallel bases $\overline{AC}$, $\overline{BD}$, find $AC$. [b]p8.[/b] How many integers $a$ with $1 \le a \le 1000$ satisfy $2^a \equiv 1$ (mod $25$) and $3^a \equiv 1$ (mod $29$)? [b]p9.[/b] Let $\vartriangle ABC$ be a right triangle with right angle at $B$ and $AB < BC$. Construct rectangle $ADEC$ such that $\overline{AC}$,$\overline{DE}$ are opposite sides of the rectangle, and $B$ lies on $\overline{DE}$. Let $\overline{DC}$ intersect $\overline{AB}$ at $M$ and let $\overline{AE}$ intersect $\overline{BC}$ at $N$. Given $CN = 6$, $BN = 4$, find the $m+n$ if $MN^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. [b]p10.[/b] An elimination-style rock-paper-scissors tournament occurs with $16$ players. The $16$ players are all ranked from $1$ to $16$ based on their rock-paper-scissor abilities where $1$ is the best and $16$ is the worst. When a higher ranked player and a lower ranked player play a round, the higher ranked player always beats the lower ranked player and moves on to the next round of the tournament. If the initial order of players are arranged randomly, and the expected value of the rank of the $2$nd place player of the tournament can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$ what is the value of $m+n$? [b]p11.[/b] Estimation (Tiebreaker) Estimate the number of twin primes (pairs of primes that differ by $2$) where both primes in the pair are less than $220022$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the sequence $(a_n)_{n\geqslant 1}$ defined by $a_1=1/2$ and $2n\cdot a_{n+1}=(n+1)a_n.$[list=a] [*]Determine the general formula for $a_n.$ [*]Let $b_n=a_1+a_2+\cdots+a_n.$ Prove that $\{b_n\}-\{b_{n+1}\}\neq \{b_{n+1}\}-\{b_{n+2}\}.$ [/list]