Alice is once again very bored in class. On a whim, she chooses three primes $p$, $q$, $r$ independently and uniformly at random from the set of primes at most 30. She then calculates the roots of $px^2+qx+r$. What is the probability that at least one of her roots is an integer?

Determine all polynomials $P(x)$ with integer coefficients such that $P(n)$ is divisible by $\sigma(n)$ for all positive integers $n$. (As usual, $\sigma(n)$ denotes the sum of all positive divisors of $n$.)

Let $ r_1 $, $ r_2 $, $ r_3 $ be the (possibly complex) roots of the polynomial $ x^3 + ax^2 + bx + \dfrac{4}{3} $. How many pairs of integers $ a $, $ b $ exist such that $ r_1^3 + r_2^3 + r_3^3 = 0 $?

If real numbers $a>b>1$ satisfy the inequality$$(ab+1)^2+(a+b)^2\leq 2(a+b)(a^2-ab+b^2+1)$$what is the minimum possible value of $\dfrac{\sqrt{a-b}}{b-1}$

For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$

Let be a natural number $ n $ and $ n $ real numbers $ a_1,a_2,\ldots ,a_n $ such that $$ a_m+a_{m+1} +\cdots +a_n\ge \frac{(m+n)(n-m+1)}{2} ,\quad\forall m\in\{ 1,2,\ldots ,n \} . $$ Prove that $ a_1^2+a_2^2+\cdots +a_n^2\ge\frac{n(n+1)(2n+1)}{6} . $

A polynomial $ P(x)$ with integer coefficients is called good,if it can be represented as a sum of cubes of several polynomials (in variable $ x$) with integer coefficients.For example,the polynomials $ x^3 \minus{} 1$ and $ 9x^3 \minus{} 3x^2 \plus{} 3x \plus{} 7 \equal{} (x \minus{} 1)^3 \plus{} (2x)^3 \plus{} 2^3$ are good. a)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7$ good? b)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7 \plus{} 3x^{2008}$ good? Justify your answers.

Prove that there exists an infinite sequence of positive integers $a_1,a_2,a_3,\dots$ such that for any positive integer $k$, $a_k^2+a_k+2023$ has at least $k$ distinct positive divisors.

The smallest positive integer that does not divide $1 \times 2 \times 3 \times 4 \times 5 \times 6 \times 7 \times 8 \times 9$ is:

Can every polynomial with integer coefficients be expressed as a sum of cubes of polynomials with integer coefficients? [hide]I found the following statement that can be linked to this problem: "It is easy to see that every polynomial in F[x] is sum of cubes if char (F)$\ne$3 and card (F)=2,4"[/hide]

Given is a positive integer $n \geq 2$. Determine the maximum value of the sum of natural numbers $k_1,k_2,...,k_n$ satisfying the condition: $k_1^3+k_2^3+ \dots +k_n^3 \leq 7n$.

a) Factorize $A= x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2$ b) Prove that there are no integers $x,y,z$ such that $x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2=2000 $

Find all the triplets of real numbers $(x , y , z)$ such that : $y=\frac{x^3+12x}{3x^2+4}$ , $z=\frac{y^3+12y}{3y^2+4}$ , $x=\frac{z^3+12z}{3z^2+4}$

Three integers are given. $A$ denotes the sum of the integers, $B$ denotes the sum of the square of the integers and $C$ denotes the sum of cubes of the integers(that is, if the three integers are $x, y, z$, then $A=x+y+z$, $B=x^2+y^2+z^2$, $C=x^3+y^3+z^3$). If $9A \geq B+60$ and $C \geq 360$, find $A, B, C$.

Find all complex numbers $m$ such that polynomial \[x^3 + y^3 + z^3 + mxyz\] can be represented as the product of three linear trinomials.

Let $D(n)$ denote the number of ways of writing the positive integer $n$ as a product$$n = f_1\cdot f_2\cdots f_k,$$where $k\ge1$, the $f_i$ are integers strictly greater than $1$, and the order in which the factors are listed matters (that is, two representations that differ only in the order of the factors are counted as distinct). For example, the number $6$ can be written as $6$, $2\cdot 3$, and $3\cdot2$, so $D(6) = 3$. What is $D(96)$? $\textbf{(A) } 112 \qquad\textbf{(B) } 128 \qquad\textbf{(C) } 144 \qquad\textbf{(D) } 172 \qquad\textbf{(E) } 184$

Which of the followings is congruent (in $\bmod{25}$) to the sum in of integers $0\leq x < 25$ such that $x^3+3x^2-2x+4 \equiv 0 \pmod{25}$? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 22 \qquad\textbf{(E)}\ \text{None of the preceding} $

Let $a,b$ be integers and $p$ be a prime number such that: (i) $p$ is the greatest common divisor of $a$ and $b$; (ii) $p^2$ divides $a$. Prove that the polynomial $x^{n+2}+ax^{n+1}+bx^{n}+a+b$ cannot be decomposed into the product of two polynomials with integer coefficients and degree greater than $1$.

Find all triples of positive integers $(a,b,c)$ such that: $a^2bc-2ab^2c-2abc^2+b^3c+bc^3+2b^2c^2=11$

For which prime numbers $p$ can we find three positive integers $n$, $x$ and $y$ such that $p^n = x^3 + y^3$?

The set of numbers $M=\{4k-3 | k\in N\}$ is considered. A number of of this set is called “simple” if it is impossible to put in the form of a product of numbers from $M$ other than $1$. Show that in this set, the decomposition of numbers in the product of "simple" factors is ambiguous.

Prove that none of the numbers $2^{2^n}+ 1$, $n = 0, 1, 2, \dots$ is a perfect cube.

After swimming around the ocean with some snorkling gear, Joshua walks back to the beach where Alexis works on a mural in the sand beside where they drew out symbol lists. Joshua walks directly over the mural without paying any attention. "You're a square, Josh." "No, $\textit{you're}$ a square," retorts Joshua. "In fact, you're a $\textit{cube}$, which is $50\%$ freakier than a square by dimension. And before you tell me I'm a hypercube, I'll remind you that mom and dad confirmed that they could not have given birth to a four dimension being." "Okay, you're a cubist caricature of male immaturity," asserts Alexis. Knowing nothing about cubism, Joshua decides to ignore Alexis and walk to where he stashed his belongings by a beach umbrella. He starts thinking about cubes and computes some sums of cubes, and some cubes of sums: \begin{align*}1^3+1^3+1^3&=3,\\1^3+1^3+2^3&=10,\\1^3+2^3+2^3&=17,\\2^3+2^3+2^3&=24,\\1^3+1^3+3^3&=29,\\1^3+2^3+3^3&=36,\\(1+1+1)^3&=27,\\(1+1+2)^3&=64,\\(1+2+2)^3&=125,\\(2+2+2)^3&=216,\\(1+1+3)^3&=125,\\(1+2+3)^3&=216.\end{align*} Josh recognizes that the cubes of the sums are always larger than the sum of cubes of positive integers. For instance, \begin{align*}(1+2+4)^3&=1^3+2^3+4^3+3(1^2\cdot 2+1^2\cdot 4+2^2\cdot 1+2^2\cdot 4+4^2\cdot 1+4^2\cdot 2)+6(1\cdot 2\cdot 4)\\&>1^3+2^3+4^3.\end{align*} Josh begins to wonder if there is a smallest value of $n$ such that \[(a+b+c)^3\leq n(a^3+b^3+c^3)\] for all natural numbers $a$, $b$, and $c$. Joshua thinks he has an answer, but doesn't know how to prove it, so he takes it to Michael who confirms Joshua's answer with a proof. What is the correct value of $n$ that Joshua found?

For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$

Let $D(n)$ denote the number of ways of writing the positive integer $n$ as a product$$n = f_1\cdot f_2\cdots f_k,$$where $k\ge1$, the $f_i$ are integers strictly greater than $1$, and the order in which the factors are listed matters (that is, two representations that differ only in the order of the factors are counted as distinct). For example, the number $6$ can be written as $6$, $2\cdot 3$, and $3\cdot2$, so $D(6) = 3$. What is $D(96)$? $\textbf{(A) } 112 \qquad\textbf{(B) } 128 \qquad\textbf{(C) } 144 \qquad\textbf{(D) } 172 \qquad\textbf{(E) } 184$