Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

It is given function $f : A \rightarrow \mathbb{R}$, $(A\subseteq \mathbb{R})$ such that $$f(x+y)=f(x)\cdot f(y)-f(xy)+1; (\forall x,y \in A)$$ If $f : A \rightarrow \mathbb{R}$, $(\mathbb{N} \subseteq A\subseteq \mathbb{R})$ is solution of given functional equation, prove that: $$f(n)=\begin{cases} \frac{c^{n+1}-1}{c-1} \text{, } \forall n \in \mathbb{N}, c \neq 1 \\ n+1 \text{, } \forall n \in \mathbb{N}, c = 1 \end{cases}$$ where $c=f(1)-1$ $a)$ Solve given functional equation for $A=\mathbb{N}$ $b)$ With $A=\mathbb{Q}$, find all functions $f$ which are solutions of the given functional equation and also $f(1997) \neq f(1998)$

You want to hang a weight $P$ so that it is $7$ m below a ceiling. To do this, it is suspended by means of a vertical cable attached to the midpoint $M$ of a chain hung by its ends from two points on the ceiling $A$ and $B$ distant from each other $4$ m. The price of the cable $PM$ is $p$ pta/m and that of the chain $AMB$ is $q$ pta/m. It is requested: a) Determine the lengths of the cable and the chain to obtain the lowest price cost of installation. b) Discuss the solution for the different values of the relation $p/q$ of both prices. (It is assumed that the weight is large enough to be considered rectile lines the chain segments $AM$ and $MB$).

For every nonempty subset $R$ of $S = \{1,2,...,10\}$, we define the alternating sum $A(R)$ as follows: If $r_1,r_2,...,r_k$ are the elements of $R$ in the increasing order, then $A(R) = r_k -r_{k-1} +r_{k-2}- ... +(-1)^{k-1}r_1$. (a) Is it possible to partition $S$ into two sets having the same alternating sum? (b) Determine the sum $\sum_{R} A(R)$, where $R$ runs over all nonempty subsets of $S$.

The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$. [i]Proposed by Mariusz Skalba, Poland[/i]

Let $\alpha\in\mathbb{Q}^+$. Determine all functions $f:\mathbb{Q}^+\to\mathbb{Q}^+$ that for all $x,y\in\mathbb{Q}^+$ satisfy the equation \[ f\left(\frac{x}{y}+y\right) ~=~ \frac{f(x)}{f(y)}+f(y)+\alpha x.\] Here $\mathbb{Q}^+$ denote the set of positive rational numbers. (Proposed by Walther Janous)

In triangle $ABC$, let $A'$, $B'$ and $C'$ be points on the sides $BC$, $CA$ and $AB$, respectively, such that$$\frac{BA'}{A'C}=\frac{CB'}{B'A}=\frac{AC'}{C'B}.$$ The line parallel to $B'C'$ passing through $A'$ intersects line $AC$ at $P$ and line $AB$ at $Q$. Prove that$$\frac{PQ}{B'C'} \geqslant 2.$$

In a planet $Papella$ year has $400$ days with days coundting from $1-400$ . A holiday would be that day which is divisible by $6$ . The new gonverment decide to reform a new calendar and split in $10$ months with $40$ day each month , and they decide that day of month which is divisible by $6$ to be holiday . Show that after reform the number of holidays after one year decreased less then $ 10 $ percent .

Juan makes a list of $2018$ numbers. The first is $ 1$. Then each number is obtained by adding to the previous number, one of the numbers $ 1$, $2$, $3$, $4$, $5$, $6$, $7$, $ 8$ or $9$. Knowing that none of the numbers in the list ends in $0$, what is the largest value you can have the last number on the list?

Given is a polynomial $P(x)$ of degree $n>1$ with real coefficients. The equation $P(P(P(x)))=P(x)$ has $n^3$ distinct real roots. Prove that these roots could be split into two groups with equal arithmetic mean.

In the Cartesian plane $\mathbb{R}^2,$ each triangle contains a Mediterranean point on its sides or in its interior, even if the triangle is degenerated into a segment or a point. The Mediterranean points have the following properties: [b](i)[/b] If a triangle is symmetric with respect to a line which passes through the origin $(0,0)$, then the Mediterranean point lies on this line. [b](ii)[/b] If the triangle $DEF$ contains the triangle $ABC$ and if the triangle $ABC$ contains the Mediterranean points $M$ of $DEF,$ then $M$ is the Mediterranean point of the triangle $ABC.$ Find all possible positions for the Mediterranean point of the triangle with vertices $(-3,5),\ (12,5),\ (3,11).$

Let non-integer real numbers $a, b,c,d$ are given, such that the sum of each $3$ of them is integer. May it happen that $ab + cd$ is an integer.

For every positive integer $n$, determine the greatest possible value of the quotient $$\frac{1-x^{n}-(1-x)^{n}}{x(1-x)^n+(1-x)x^n}$$ where $0 < x < 1$.

Let $x_1, x_2, \ldots , x_n \ (n \geq 1)$ be real numbers such that $0 \leq x_j \leq \pi, \ j = 1, 2,\ldots, n.$ Prove that if $\sum_{j=1}^n (\cos x_j +1) $ is an odd integer, then $\sum_{j=1}^n \sin x_j \geq 1.$

Let $a, b, c$ be positive real numbers satisfying \[a+b+c = a^2 + b^2 + c^2.\] Let \[M = \max\left(\frac{2a^2}{b} + c, \frac{2b^2}{a} + c \right) \quad \text{ and } \quad N = \min(a^2 + b^2, c^2).\] Find the minimum possible value of $M/N$.

[b]i.)[/b] Let $ABC$ be a triangle with $AB = 12$ and $AC = 16.$ Suppose $M$ is the midpoint of side $BC$ and points $E$ and $F$ are chosen on sides $AC$ and $AB$, respectively, and suppose that lines $EF$ and $AM$ intersect at $G.$ If $AE = 2 \cdot AF$ then find the ratio \[ \frac{EG}{GF} \] [b]ii.)[/b] Let $E$ be a point external to a circle and suppose that two chords $EAB$ and $EDC$ meet at angle of $40^{\circ}.$ If $AB = BC = CD$ find the size of angle $ACD.$

Goldfish are sold at $ 15$ cents each. The rectangular coordinate graph showing the cost of $ 1$ to $ 12$ goldfish is: $ \textbf{(A)}\ \text{a straight line segment} \qquad \\ \textbf{(B)}\ \text{a set of horizontal parallel line segments}\qquad \\ \textbf{(C)}\ \text{a set of vertical parallel line segments}\qquad \\ \textbf{(D)}\ \text{a finite set of distinct points}\qquad \textbf{(E)}\ \text{a straight line}$

Let $n$ be a natural number and let $P (t) = 1 + t + t^2 + ... + t^{2n}$. If $x \in R$ such that $P (x)$ and $P (x^2)$ are rational numbers, prove that $x$ is rational number.

Which of the numbers $2^{2002}$ and $2000^{200}$ is bigger?

Let $\{x_n\}$ be a sequence defined by $x_1 = 2$ and $x_{n+1} = x_n^2 - x_n + 1$ for $n \ge 1$. Prove that $$1 -\frac{1}{2^{2^{n-1}}} < \frac{1}{x_1}+\frac{1}{x_2}+ ... +\frac{1}{x_n}< 1 -\frac{1}{2^{2^n}}$$ for all $n$

How many values of $x\in\left[ 1,3 \right]$ are there, for which $x^2$ has the same decimal part as $x$?

Suppose the real numbers $a, A, b, B$ satisfy the inequalities: $$|A - 3a| \le 1 - a\,\,\, , \,\,\, |B -3b| \le 1 - b$$, and $a, b$ are positive. Prove that $$\left|\frac{AB}{3}- 3ab\right | - 3ab \le 1 - ab.$$

[b]a)[/b] Show that $ \frac{n}{2}\ge \frac{2\sqrt{x} +3\sqrt[3]{x}+\cdots +n\sqrt[n]{x}}{n-1} -x, $ for all non-negative reals $ x $ and integers $ n\ge 2. $ [b]b)[/b] If $ x,y,z\in (0,\infty ) , $ then prove the inequality $$ \sum_{\text{cyc}} \frac{x}{(2x+y+z)^2+4} \le 3/16 $$

$b_0, b_1, b_2, \dots$ is a sequence of positive reals such that the sequence $b_0,c b_1, c^2b_2,c^3b_3,\dots$ is convex for all $c > 0$. (A sequence is convex if each term is at most the arithmetic mean of its two neighbors.) Show that $\ln b_0, \ln b_1, \ln b_2, \dots$ is convex.

Let $P(z)$ be a polynomial with real coefficients whose roots are covered by a disk of radius R. Prove that for any real number $k$, the roots of the polynomial $nP(z)-kP'(z)$ can be covered by a disk of radius $R+|k|$, where $n$ is the degree of $P(z)$, and $P'(z)$ is the derivative of $P(z)$. can anyone help me? It would also be extremely helpful if anyone could tell me where they've seen this type of problems.............Has it appeared in any mathematics competitions? Or are there any similar questions for me to attempt? Thanks in advance!