Let n be a positive integer. Find all complex numbers $x_{1}$, $x_{2}$, ..., $x_{n}$ satisfying the following system of equations: $x_{1}+2x_{2}+...+nx_{n}=0$, $x_{1}^{2}+2x_{2}^{2}+...+nx_{n}^{2}=0$, ... $x_{1}^{n}+2x_{2}^{n}+...+nx_{n}^{n}=0$.

The battery life on a computer decreases at a rate proportional to the display brightness. Austin starts off his day with both his battery life and brightness at $100\%$. Whenever his battery life (expressed as a percentage) reaches a multiple of $25$, he also decreases the brightness of his display to that multiple of $25$. If left at $100\%$ brightness, the computer runs out of battery in $1$ hour. Compute the amount of time, in minutes, it takes for Austin’s computer to reach $0\%$ battery using his modified scheme.

The third-degree polynomial $P(x)=x^3+2x^2-3x-5$ has the three roots $a$, $b$ and $c$. State a third degree polynomial with roots $\frac{1}{a}$, $\frac{1}{b}$ and $\frac{1}{c}$.

Let $P(X)=aX^3-\frac16 X$ where $a\in\mathbb{R}$. [b]1)[/b] Determine $a$ such that for every $\alpha\in\mathbb{Z}$ we have $P(\alpha)\in\mathbb{Z}$. [b]2)[/b] Show that if $a$ is irrational then for every $0<u<v<1$ there exists $n\in\mathbb{Z}$ such that \[u<P(n)-\lfloor P(n)\rfloor <v.\] Generalize the problem!

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]

Prove that there are no rational numbers $x,y,z$ with $x+y+z=0$ and $x^2+y^2+z^2=100$.

Let there's a function $ f: \mathbb{R}\rightarrow\mathbb{R}$ Find all functions $ f$ that satisfies: a) $ f(2u)\equal{}f(u\plus{}v)f(v\minus{}u)\plus{}f(u\minus{}v)f(\minus{}u\minus{}v)$ b) $ f(u)\geq0$

Show that the sequence $ a_n \equal{} \frac {(n \plus{} 1)^nn^{2 \minus{} n}}{7n^2 \plus{} 1}$ is strictly monotonically increasing, where $ n \equal{} 0,1,2, \dots$.

Positive real numbers $a, b$ are such that $a^3 + b^3 = 2$. Show that that $\frac{1}{a}+\frac{1}{b}\ge 2(a^2 - a + 1)(b^2 - b + 1)$.

Let $n$ be an integer greater than $1$. Define \[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\] where $[z]$ denotes the largest integer less than or equal to $z$. Prove that \[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]

Let $x_1, ..., x_n$ ($n \ge 2$) be real numbers from the interval $[1, 2]$. Prove that $|x_1 - x_2| + ... + |x_n - x_1| \le \frac{2}{3}(x_1 + ... + x_n)$, with equality holding if and only if $n$ is even and the $n$-tuple $(x_1, x_2, ..., x_{n - 1}, x_n)$ is equal to $(1, 2, ..., 1, 2)$ or $(2, 1, ..., 2, 1)$.

[hide=B stands for Bernoulli, G stands for Germain]they had two problem sets under those two names[/hide] [u]Set 1[/u] [b]B1 / G1[/b] Find $20^3 + 2^2 + 3^1$. [b]B2[/b] A piece of string of length $10$ is cut $4$ times into strings of equal length. What is the length of each small piece of string? [b]B3 / G2[/b] What is the smallest perfect square that is also a perfect cube? [b]B4[/b] What is the probability a $5$-sided die with sides labeled from $1$ through $5$ rolls an odd number? [b]B5 / G3[/b] Hanfei spent $14$ dollars on chicken nuggets at McDonalds. $4$ nuggets cost $3$ dollars, $6$ nuggets cost $4$ dollars, and $12$ nuggets cost $9$ dollars. How many chicken nuggets did Hanfei buy? [u]Set 2[/u] [b]B6[/b] What is the probability a randomly chosen positive integer less than or equal to $15$ is prime? [b]B7[/b] Andrew flips a fair coin with sides labeled 0 and 1 and also rolls a fair die with sides labeled $1$ through $6$. What is the probability that the sum is greater than $5$? [b]B8 / G4[/b] What is the radius of a circle with area $4$? [b]B9[/b] What is the maximum number of equilateral triangles on a piece of paper that can share the same corner? [b]B10 / G5[/b] Bob likes to make pizzas. Bab also likes to make pizzas. Bob can make a pizza in $20$ minutes. Bab can make a pizza in $30$ minutes. If Bob and Bab want to make $50$ pizzas in total, how many hours would that take them? [u]Set 3[/u] [b]B11 / G6[/b] Find the area of an equilateral rectangle with perimeter $20$. [b]B12 / G7[/b] What is the minimum possible number of divisors that the sum of two prime numbers greater than $2$ can have? [b]B13 / G8[/b] Kwu and Kz play rock-paper-scissors-dynamite, a variant of the classic rock-paperscissors in which dynamite beats rock and paper but loses to scissors. The standard rock-paper-scissors rules apply, where rock beats scissors, paper beats rock, and scissors beats paper. If they throw out the same option, they keep playing until one of them wins. If Kz randomly throws out one of the four options with equal probability, while Kwu only throws out dynamite, what is the probability Kwu wins? [b]B14 / G9[/b] Aven has $4$ distinct baguettes in a bag. He picks three of the bagged baguettes at random and lays them on a table in random order. How many possible orderings of three baguettes are there on the table? [b]B15 / G10[/b] Find the largest $7$-digit palindrome that is divisible by $11$. PS. You should use hide for answers. Rest problems have been posted [url=https://artofproblemsolving.com/community/c3h3132170p28376644]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that $$ f\left(x^2\right) - yf(y) = f(x + y) (f(x) - y) $$ for all real numbers $x$ and $y$.

Consider the sequence $a_{1}, a_{2}, a_{3},\ldots$ defined by $a_{1}=2024^{2024}$ and for each positive integer $n$, $$a_{n+1}=\left|a_{n}-\sqrt{2}\right|.$$ Prove that there exists an integer $k$ such that $a_{k+2}=a_k$. [i]Here [/i]$\left|x\right|$[i] denotes the absolute value of [/i]$x$.

A quadratic polynomial $p(x)$ has positive real coefficients with sum $1$. Show that given any positive real numbers with product $1$, the product of their values under $p$ is at least $1$.

How many distinct arrangements are possible for wearing five different rings in the five fingers of the right hand? (We can wear multiple rings in one finger) [list=1] [*] $\frac{10!}{5!}$ [*] $5^5$ [*] $\frac{9!}{4!}$ [*] None of these [/list]

Can the equation $x^3-2x^2-2x+m = 0$ have three different rational roots?

We say that a real $a\geq-1$ is philosophical if there exists a sequence $\epsilon_1,\epsilon_2,\dots$, with $\epsilon_i \in\{-1,1\}$ for all $i\geq1$, such that the sequence $a_1,a_2,a_3,\dots$, with $a_1=a$, satisfies $$a_{n+1}=\epsilon_{n}\sqrt{a_{n}+1},\forall n\geq1$$ and is periodic. Find all philosophical numbers.

Find all real-valued functions $f$ on the reals such that $f(-x) = -f(x)$, $f(x+1) = f(x) + 1$ for all $x$, and $f\left(\dfrac{1}{x}\right) = \dfrac{f(x)}{x^2}$ for $x \not = 0$.

Consider all sums that add up to $2015$. In each sum, the addends are consecutive positive integers, and all sums have less than $10$ addends. How many such sums are there?

Prove that for every $ n = 2, 3, \ldots $ and any real numbers $ t_1, t_2, \ldots, t_n $, $ s_1, s_2, \ldots, s_n $, if $$ \sum_{i=1}^n t_i = 0, \text{ to } \sum_{i=1}^n\sum_{j=1}^n t_it_j |s_i-s_j| \leq 0.$$

Given a positive integer $n$, suppose that $P(x,y)$ is a real polynomial such that \[P(x,y)=\frac{1}{1+x+y} \hspace{0.5cm} \text{for all $x,y\in\{0,1,2,\dots,n\}$} \] What is the minimum degree of $P$? [i]Proposed by Loke Zhi Kin[/i]

Solve the recurrence $R_0=1, R_n=nR_{n-1}+2^n\cdot n!$.

Let $f(x) = ax^2 + bx+ c$ and $g(x) = cx^2 + bx + a$. If $|f(0)| \leq 1, |f(1)| \leq 1, |f(-1)| \leq 1$, prove that for $|x| \leq 1$, [b](a)[/b] $|f(x)| \leq 5/4$, [b](b)[/b] $|g(x)| \leq 2$.

Consider the sequence $(a_n)_{n\ge 1}$ such that $a_1=1$ and $a_{n+1}=\sqrt{a_n+n^2}$, $\forall n\ge 1$. $\textbf{(a)}$ Prove that there is exactly one rational number among the numbers $a_1,a_2,a_3,\dots$. $\textbf{(b)}$ Consider the sequence $(S_n)_{n\ge 1}$ such that $$S_n=\sum_{i=1}^n\frac{4}{\left (\left \lfloor a_{i+1}^2\right \rfloor-\left \lfloor a_i^2\right \rfloor\right)\left(\left \lfloor a_{i+2}^2\right \rfloor-\left \lfloor a_{i+1}^2\right \rfloor\right)}.$$ Prove that there exists an integer $N$ such that $S_n>0.9$, $\forall n>N$. [i] (Stefan Obadă)[/i]