Polly can do the following operations on a quadratic trinomial: 1) Swapping the places of its leading coefficient and constant coefficient (swapping $a_2$ with $a_0$); 2) Substituting (changing) $x$ with $x-m$, where $m$ is an arbitrary real number; Is it possible for Polly to get $25x^2+5x+2014$ from $6x^2+2x+1996$ with finite applications of the upper operations?

Denote by $ d(n)$ the number of all positive divisors of a natural number $ n$ (including $ 1$ and $ n$). Prove that there are infinitely many $ n$, such that $ n/d(n)$ is an integer.

Assume $p$ is a prime number. If there is a positive integer $a$ such that $p!|(a^p + 1)$, prove that : (1) $(a+1, \frac{a^p+1}{a+1}) = p$ (2) $\frac{a^p+1}{a+1}$ has no prime factors less than $p$. (3) $p!|(a +1) $.

Given a polynomial $P$ and a positive integer $k$, we denote the $k$-fold composition of $P$ by $P^{\circ k}$. A polynomial $P$ with real coefficients is called [b]perfect[/b] if for each integer $n$ there is a positive integer $k$ so that $P^{\circ k}(n)$ is an integer. Is it true that for each perfect polynomial $P$, there exists a positive $m$ so that for each integer $n$ there is $0<k\leq m$ for which $P^{\circ k}(n)$ is an integer?

You are given three lists $A$, $B$, and $C$. List $A$ contains the numbers of the form $10^k$ in base $10$, with $k$ any integer greater than or equal to $1$. Lists $B$ and $C$ contain the same numbers translated into base $2$ and $5$ respectively: $$\begin{array}{lll} A & B & C \\ 10 & 1010 & 20 \\ 100 & 1100100 & 400 \\ 1000 & 1111101000 & 13000 \\ \vdots & \vdots & \vdots \end{array}$$ Prove that for every integer $n > 1$, there is exactly one number in exactly one of the lists $B$ or $C$ that has exactly $n$ digits.

There are three number-transforming machines. We input the pair $(a_1, a_2)$, and the machine returns $(b_1, b_2)$. We denote this transformation as $(a_1, a_2) \to (b_1, b_2)$. (a) The first machine can perform two transformations: - $(a, b) \to (a - 1, b - 1)$ - $(a, b) \to (a + 13, b + 5)$ If the input pair is $(25,32)$, is it possible to obtain the pair $(82,98)$ after a series of transformations? (b) The second machine can perform two transformations: - $(a, b) \to (a - 1, b - 1)$ - $(a, b) \to (2a, 2b)$ If the input pair is $(34,60)$, is it possible to obtain the pair $(2000, 2008)$ after a series of transformations? (c) The third machine can perform two transformations: - $(a, b) \to (a - 2, b + 2)$ - $(a, b) \to (2a - b + 1, 2b - 1 - a)$ If the input pair is $(145,220)$, is it possible to obtain the pair $(363,498)$ after a series of transformations?

Let $n$ be a positive integer. Show that if p is prime dividing $5^{4n}-5^{3n}+5^{2n}-5^{n}+1$, then $p\equiv 1 \;(\bmod\; 4)$.

Determine whether the equation $$x^4+y^3=z!+7$$ has an infinite number of solutions in positive integers.

For how many natural numbers $n$ between $1$ and $2014$ (both inclusive) is $\frac{8n}{9999-n}$ an integer?

Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation \[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\] that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$

Find all the pairs of positive integers $(m,n)$ such that the numbers $A=n^2+2mn+3m^2+3n$, $B=2n^2+3mn+m^2$, $C=3n^2+mn+2m^2$ are consecutive in some order.

Find the smallest real $\lambda$, such that for any positive integers $n, a, b$, such that $n \nmid a+b$, there exists a positive integer $1 \leq k \leq n-1$, satisfying $$\{\frac{ak} {n}\}+\{\frac{bk} {n}\} \leq \lambda.$$

Let $d(n)$ denote the number of positive divisors of $n$. For positive integer $n$ we define $f(n)$ as $$f(n) = d\left(k_1\right) + d\left(k_2\right)+ \cdots + d\left(k_m\right),$$ where $1 = k_1 < k_2 < \cdots < k_m = n$ are all divisors of the number $n$. We call an integer $n > 1$ [i]almost perfect[/i] if $f(n) = n$. Find all almost perfect numbers. [i]Paulius Ašvydis[/i]

Find all the triples $(x,y,z)$ of positive integers such that $xy+yz+zx-xyz=2$.

Determine, for each positive integer $n$, the largest positive integer $k$ such that $2^k$ is a divisor of $3^n+1$.

Arithmetic sequences $ (a_n)$ and $ (b_n)$ have integer terms with $ a_1 \equal{} b_1 \equal{} 1 < a_2 \le b_2$ and $ a_nb_n \equal{} 2010$ for some $ n$. What is the largest possible value of $ n$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 288 \qquad \textbf{(E)}\ 2009$

Let A be a subset of natural numbers and let k , r be positive integers. Suppose that for any r different elements selected from A , their greatest common divisor has at most k different prime factors. Prove that A can be partitioned into B and C , where any element of B has at most k + 1 different prime divisors and $$\sum_{n\in C} \frac{1}{n} <\infty$$

Find all the pairs of natural numbers $(a, b),$ such that \[a!+1=(a+1)^{(2^b)}\]

Find all triplets of positive integers $(a,b,c)$ for which the number $3^a+3^b+3^c$ is a perfect square.

Let $0 = a_1 < a_2 < a_3 < \cdots < a_n < 1$ and $0 = b_1 < b_2 < b_3 \cdots < b_m < 1$ be real numbers such that for no $a_j$ and $b_k$ the relation $a_j + b_k = 1$ is satisfied. Prove that if the $mn$ numbers ${\ a_j + b_k : 1 \leq j \leq n , 1 \leq k \leq m \}}$ are reduced modulo $1$, then at least $m+n -1$ residues will be distinct.

Among all eight-digit multiples of four, are there more numbers with the digit $1$ or without the digit $1$ in their decimal representation?

Determine the greatest common divisor of the numbers $p^6-7p^2+6$ where $p$ runs through the prime numbers $p \ge 11$.

For a natural number $m>1$ we'll denote with $f(m)$ the sum of all natural numbers less than $m$, which are also coprime to $m$. Find all natural numbers $n$, such that there exist natural numbers $k$ and $\ell$ which satisfy $f(n^{k})=n^{\ell}$.

[b]p1.[/b] Compute $$\left(\frac{1}{10}\right)^{\frac12}\left(\frac{1}{10^2}\right)^{\frac{1}{2^4}}\left(\frac{1}{10^3}\right)^{\frac{1}{2^3}} ...$$ [b]p2.[/b] Consider the sequence $1, 2, 2, 3, 3, 3, 4, 4, 4, 4,...,$ where the positive integer $m$ appears $m$ times. Let $d(n)$ denote the $n$th element of this sequence starting with $n = 1$. Find a closed-form formula for $d(n)$. [b]p3.[/b] Let $0 < \theta < \frac{\pi}{2}$, prove that $$ \left( \frac{\sin^2 \theta}{2}+\frac{2}{\cos^2 \theta} \right)^{\frac14}+ \left( \frac{\cos^2 \theta}{2}+\frac{2}{\sin^2 \theta} \right)^{\frac14} \ge (68)^{\frac14} $$ and determine the value of \theta when the inequality holds as equality. [b]p4.[/b] In $\vartriangle ABC$, parallel lines to $AB$ and $AC$ are drawn from a point $Q$ lying on side $BC$. If $a$ is used to represent the ratio of the area of parallelogram $ADQE$ to the area of the triangle $\vartriangle ABC$, (i) find the maximum value of $a$. (ii) find the ratio $\frac{BQ}{QC}$ when $a =\frac{24}{49}.$ [img]https://cdn.artofproblemsolving.com/attachments/5/8/eaa58df0d55e6e648855425e581a6ba0ad3ea6.png[/img] [b]p5.[/b] Prove the following inequality $$\frac{1}{2009} < \frac{1}{2} \cdot \frac{3}{4} \cdot \frac{5}{6} \cdot \frac{7}{8}...\frac{2007}{2008}<\frac{1}{40}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].Thanks to gauss202 for sending the problems.

We call the positive integer $n$ a $3-$[i]stratum[/i] number if we can divide the set of its positive divisors into $3$ subsets such that the sum of each subset is equal to the others. $a)$ Find a $3-$stratum number. $b)$ Prove that there are infinitely many $3-$stratum numbers.