If $a > b > 0$, prove the inequality $$\frac{(a-b)^2}{8a}< \frac{a+b}{2}- \sqrt{ab} < \frac{(a-b)^2}{8b}.$$

Determine $x^2+y^2$ and $x^4+y^4$, when $x^3+y^3=2$ and $x+y=1$

Find all function $f:\mathbb{R}\to \mathbb{R}$ such that \[f(x)f(y)=f(xy-1)+yf(x)+xf(y)\] for all $x,y \in \mathbb{R}$

Let us define a function $f:\mathbb N\to\mathbb N_0$ by $f(1)=0$ and, for all $n\in\mathbb N$, $$f(2n)=2f(n)+1,\qquad f(2n+1)=2f(n).$$Given a positive integer $p$, define a sequence $(u_n)$ by $u_0=p$ and $u_{k+1}=f(u_k)$ whenever $u_k\ne0$. (a) Prove that, for each $p\in\mathbb N$, there is a unique integer $v(p)$ such that $u_{v(p)}=0$. (b) Compute $v(1994)$. What is the smallest integer $p>0$ for which $v(p)=v(1994)$. (c) Given an integer $N$, determine the smallest integer $p$ such that $v(p)=N$.

[b]p1.[/b] An Egyptian fraction has the form $1/n$, where $n$ is a positive integer. In ancient Egypt, these were the only fractions allowed. Other fractions between zero and one were always expressed as a sum of distinct Egyptian fractions. For example, $3/5$ was seen as $1/2 + 1/10$, or $1/3 + 1/4 + 1/60$. The preferred method of representing a fraction in Egypt used the "greedy" algorithm, which at each stage, uses the Egyptian fraction that eats up as much as possible of what is left of the original fraction. Thus the greedy fraction for $3/5$ would be $1/2 + 1/10$. a) Find the greedy Egyptian fraction representations for $2/13$. b) Find the greedy Egyptian fraction representations for $9/10$. c) Find the greedy Egyptian fraction representations for $2/(2k+1)$, where $k$ is a positive integer. d) Find the greedy Egyptian fraction representations for $3/(6k+1)$, where $k$ is a positive integer. [b]p2.[/b] a) The smaller of two concentric circles has radius one unit. The area of the larger circle is twice the area of the smaller circle. Find the difference in their radii. [img]https://cdn.artofproblemsolving.com/attachments/8/1/7c4d81ebfbd4445dc31fa038d9dc68baddb424.png[/img] b) The smaller of two identically oriented equilateral triangles has each side one unit long. The smaller triangle is centered within the larger triangle so that the perpendicular distance between parallel sides is always the same number $d$. The area of the larger triangle is twice the area of the smaller triangle. Find $d$. [img]https://cdn.artofproblemsolving.com/attachments/8/7/1f0d56d8e9e42574053c831fa129eb40c093d9.png[/img] [b]p3.[/b] Suppose that the domain of a function $f$ is the set of real numbers and that $f$ takes values in the set of real numbers. A real number $x_0$ is a fixed point of f if $f(x_0) = x_0$. a) Let $f(x) = m x + b$. For which $m$ does $f$ have a fixed point? b) Find the fixed point of f$(x) = m x + b$ in terms of m and b, when it exists. c) Consider the functions $f_c(x) = x^2 - c$. i. For which values of $c$ are there two different fixed points? ii. For which values of $c$ are there no fixed points? iii. In terms of $c$, find the value(s) of the fixed point(s). d) Find an example of a function that has exactly three fixed points. [b]p4.[/b] A square based pyramid is made out of rubber balls. There are $100$ balls on the bottom level, 81 on the next level, etc., up to $1$ ball on the top level. a) How many balls are there in the pyramid? b) If each ball has a radius of $1$ meter, how tall is the pyramid? c) What is the volume of the solid that you create if you place a plane against each of the four sides and the base of the balls? [b]p5.[/b] We wish to consider a general deck of cards specified by a number of suits, a sequence of denominations, and a number (possibly $0$) of jokers. The deck will consist of exactly one card of each denomination from each suit, plus the jokers, which are "wild" and can be counted as any possible card of any suit. For example, a standard deck of cards consists of $4$ suits, $13$ denominations, and $0$ jokers. a) For a deck with $3$ suits $\{a, b, c\}$ and $7$ denominations $\{1, 2, 3, 4, 5, 6, 7\}$, and $0$ jokers, find the probability that a 3-card hand will be a straight. (A straight consists of $3$ cards in sequence, e.g., $1 \heartsuit$ ,$2 \spadesuit$ , $3\clubsuit$ , $2\diamondsuit$ but not $6 \heartsuit$ ,$7 \spadesuit$ , $1\diamondsuit$). b) For a deck with $3$ suits, $7$ denominations, and $0$ jokers, find the probability that a $3$-card hand will consist of $3$ cards of the same suit (i.e., a flush). c) For a deck with $3$ suits, $7$ denominations, and $1$ joker, find the probability that a $3$-card hand dealt at random will be a straight and also the probability that a $3$-card hand will be a flush. d) Find a number of suits and the length of the denomination sequence that would be required if a deck is to contain $1$ joker and is to have identical probabilities for a straight and a flush when a $3$-card hand is dealt. The answer that you find must be an answer such that a flush and a straight are possible but not certain to occur. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For what real numbers $p$ has the system of equations $$\begin{cases} x_1^4+\dfrac{1}{x_1^2}=px_2 \\ \\ x_2^4+\dfrac{1}{x_2^2}=px_3 \\ ... \\ x_{2004}^4+\dfrac{1}{x_{2004}^2}=px_{2005} \\ \\ x_{2005}^4+\dfrac{1}{x_{2005}^2}=px_{1}\end{cases}$$ just one solution $(x_1,x_2,...,x_{2005})$, where $x_1,x_2,...,x_{2005}$ are real numbers?

Find all functions $f:\mathbb{N}\to\mathbb{R}$ such that $f(km)+f(kn)-f(k)f(mn)\ge 1$ for all $k,m,n\in\mathbb{N}$.

Find all functions $f: \mathbb{Q^+} \rightarrow \mathbb{Q}$ satisfying $f(x)+f(y)= \left(f(x+y)+\frac{1}{x+y} \right) (1-xy+f(xy))$ for all $x, y \in \mathbb{Q^+}$.

The roots of $ Ax^2 \plus{} Bx \plus{} C \equal{} 0$ are $ r$ and $ s$. For the roots of \[ x^2 \plus{} px \plus{} q \equal{} 0 \] to be $ r^2$ and $ s^2$, $ p$ must equal: $ \textbf{(A)}\ \frac{B^2 \minus{} 4AC}{A^2}\qquad \textbf{(B)}\ \frac{B^2 \minus{} 2AC}{A^2}\qquad \textbf{(C)}\ \frac{2AC \minus{} B^2}{A^2}\qquad \\ \textbf{(D)}\ B^2 \minus{} 2C\qquad \textbf{(E)}\ 2C \minus{} B^2$

Given any $7$ real numbers, prove that there are two of them $x,y$ such that $0\le\frac{x-y}{1+xy}\le\frac{1}{\sqrt{3}}$.

Let $x_1<x_2<x_3$ be three real roots of equation $\sqrt{2014}x^3-4029x^2+2=0$. Find $x_2(x_1+x_3)$.

Alexa wrote the first $16$ numbers of a sequence: \[1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, …\] Then she continued following the same pattern, until she had $2015$ numbers in total. What was the last number she wrote?

For each real value of $p$, find all real solutions of the equation $\sqrt{x^2 - p}+2\sqrt{x^2-1} = x$.

Prove that if the roots of the equation $x^2 + px + q = 0$ are real, then for any real number $a$ the roots of the equation $$x^2 + px + q + (x + a) (2x + p) = 0$$ are also real.

There are $2024$ points of general position marked on the coordinate plane (i.e., points among which there are no three lying on the same straight line). Is there a polynomial of two variables $f(x,y)$ a) of degree $2025$; b) of degree $2024$ such that it equals to zero exactly at these marked points? [i]Proposed by Navid Safaei[/i]

$P(x)$ is a monoic polynomial with integer coefficients so that there exists monoic integer coefficients polynomials $p_1(x),p_2(x),\dots ,p_n(x)$ so that for any natural number $x$ there exist an index $j$ and a natural number $y$ so that $p_j(y)=P(x)$ and also $deg(p_j) \ge deg(P)$ for all $j$.Show that there exist an index $i$ and an integer $k$ so that $P(x)=p_i(x+k)$.

$(SWE 2)$ For each $\lambda (0 < \lambda < 1$ and $\lambda = \frac{1}{n}$ for all $n = 1, 2, 3, \cdots)$, construct a continuous function $f$ such that there do not exist $x, y$ with $0 < \lambda < y = x + \lambda \le 1$ for which $f(x) = f(y).$

Consider the equation $ x^4 \minus{} 4x^3 \plus{} 4x^2 \plus{} ax \plus{} b \equal{} 0$, where $ a,b\in\mathbb{R}$. Determine the largest value $ a \plus{} b$ can take, so that the given equation has two distinct positive roots $ x_1,x_2$ so that $ x_1 \plus{} x_2 \equal{} 2x_1x_2$.

Let $\displaystyle a,b,c,d \in \mathbb R$ such that $\displaystyle a>c>d>b>1$ and $\displaystyle ab>cd$. Prove that $\displaystyle f : \left[ 0,\infty \right) \to \mathbb R$, defined through \[ \displaystyle f(x) = a^x+b^x-c^x-d^x, \, \forall x \geq 0 , \] is strictly increasing.

International Mathematical Olympiad National Selection Test Malaysia 2021 Round 1 Primary Time: 2.5 hours [hide=Rules] $\bullet$ For each problem you have to submit the answer only. The answer to each problem is a non-negative integer. $\bullet$ No mark is deducted for a wrong answer. $\bullet$ The maximum number of points is (1 + 2 + 3 + 4) x 5 = 50 points.[/hide] [b]Part A[/b] (1 point each) p1. Faris has six cubes on his table. The cubes have a total volume of $2021$ cm$^3$. Five of the cubes have side lengths $5$ cm, $5$ cm, $6$ cm, $6$ cm, and $11$ cm. What is the side length of the sixth cube (in cm)? p2. What is the sum of the first $200$ even positive integers? p3. Anushri writes down five positive integers on a paper. The numbers are all different, and are all smaller than $10$. If we add any two of the numbers on the paper, then the result is never $10$. What is the number that Anushri writes down for certain? p4. If the time now is $10.00$ AM, what is the time $1,000$ hours from now? Note: Enter the answer in a $12$-hour system, without minutes and AM/PM. For example, if the answer is $9.00$ PM, just enter $9$. p5. Aminah owns a car worth $10,000$ RM. She sells it to Neesha at a $10\%$ profit. Neesha sells the car back to Aminah at a $10\%$ loss. How much money did Aminah make from the two transactions, in RM? [b]Part B[/b] (2 points each) p6. Alvin takes 250 small cubes of side length $1$ cm and glues them together to make a cuboid of size $5$ cm  $\times 5$ cm  $\times 10$ cm. He paints all the faces of the large cuboid with the color green. How many of the small cubes are painted by Alvin? p7. Cikgu Emma and Cikgu Tan select one integer each (the integers do not have to be positive). The product of the two integers they selected is $2021$. How many possible integers could have been selected by Cikgu Emma? p8. A three-digit number is called [i]superb[/i] if the first digit is equal to the sum of the other two digits. For example, $431$ and $909$ are superb numbers. How many superb numbers are there? p9. Given positive integers $a, b, c$, and $d$ that satisfy the equation $4a = 5b =6c = 7d$. What is the smallest possible value of $ b$? p10. Find the smallest positive integer n such that the digit sum of n is divisible by $5$, and the digit sum of $n + 1$ is also divisible by $5$. Note: The digit sum of $1440$ is $1 + 4 + 4 + 0 = 9$. [b]Part C[/b] (3 points each) p11. Adam draws $7$ circles on a paper, with radii $ 1$ cm, $2$ cm, $3$ cm, $4$ cm, $5$ cm, $6$ cm, and $7$ cm. The circles do not intersect each other. He colors some circles completely red, and the rest of the circles completely blue. What is the minimum possible difference (in cm$^2$) between the total area of the red circles and the total area of the blue circles? p12. The number $2021$ has a special property that the sum of any two neighboring digits in the number is a prime number ($2 + 0 = 2$, $0 + 2 = 2$, and $2 + 1 = 3$ are all prime numbers). Among numbers from $2021$ to $2041$, how many of them have this property? p13. Clarissa opens a pet shop that sells three types of pets: goldshes, hamsters, and parrots. The pets inside the shop together have a total of $14$ wings, $24$ heads, and $62$ legs. How many goldshes are there inside Clarissa's shop? p14. A positive integer $n$ is called [i]special [/i] if $n$ is divisible by $4$, $n+1$ is divisible by $5$, and $n + 2$ is divisible by $6$. How many special integers smaller than $1000$ are there? p15. Suppose that this decade begins on $ 1$ January $2020$ (which is a Wednesday) and the next decade begins on $ 1$ January $2030$. How many Wednesdays are there in this decade? [b]Part D[/b] (4 points each) p16. Given an isosceles triangle $ABC$ with $AB = AC$. Let D be a point on $AB$ such that $CD$ is the bisector of $\angle ACB$. If $CB = CD$, what is $\angle ADC$, in degrees? p17. Determine the number of isosceles triangles with the following properties: all the sides have integer lengths (in cm), and the longest side has length $21$ cm. p18. Haz marks $k$ points on the circumference of a circle. He connects every point to every other point with straight lines. If there are $210$ lines formed, what is $k$? p19. What is the smallest positive multiple of $24$ that can be written using digits $4$ and $5$ only? p20. In a mathematical competition, there are $2021$ participants. Gold, silver, and bronze medals are awarded to the winners as follows: (i) the number of silver medals is at least twice the number of gold medals, (ii) the number of bronze medals is at least twice the number of silver medals, (iii) the number of all medals is not more than $40\%$ of the number of participants. The competition director wants to maximize the number of gold medals to be awarded based on the given conditions. In this case, what is the maximum number of bronze medals that can be awarded? PS. Problems 11-20 were also used in [url=https://artofproblemsolving.com/community/c4h2676837p23203256]Juniors [/url]as 1-10.

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$, such that $f(x+y) = f(y) f(x f(y))$ for every two real numbers $x$ and $y$.

Find all functions $f: \mathbb{N} \rightarrow \mathbb{N}$ such that (a) $f(1)=1$ (b) $f(n+2)+(n^2+4n+3)f(n)=(2n+5)f(n+1)$ for all $n \in \mathbb{N}$. (c) $f(n)$ divides $f(m)$ if $m>n$.

[b](a)[/b] Prove that for all positive integers $m,n$ we have \[\sum_{k=1}^n k(k+1)(k+2)\cdots (k+m-1)=\frac{n(n+1)(n+2) \cdots (n+m)}{m+1}\] [b](b)[/b] Let $P(x)$ be a polynomial with rational coefficients and degree $m.$ If $n$ tends to infinity, then prove that \[\frac{\sum_{k=1}^n P(k)}{n^{m+1}}\] Has a limit.

For every natural number $ n$, find all polynomials $ x^2\plus{}ax\plus{}b$, where $ a^2 \ge 4b$, that divide $ x^{2n}\plus{}ax^n\plus{}b$.

There is the sequence of numbers $1, a_2, a_3, ...$ such that satisfies $1 \cdot a_2 \cdot a_3 \cdot ... \cdot a_n = n^2$, for every integer $n> 2$. Determine the value of $a_3 + a_5$.