For a positive integer $n$, let $P(n)$ be the product of the factors of $n$ (including $n$ itself). A positive integer $n$ is called [i]deplorable [/i] if $n > 1$ and $\log_n P(n)$ is an odd integer. How many factors of $2016$ are [i]deplorable[/i]?

Determine all functions $f: \mathbb{Q} \rightarrow \mathbb{Z} $ satisfying \[ f \left( \frac{f(x)+a} {b}\right) = f \left( \frac{x+a}{b} \right) \] for all $x \in \mathbb{Q}$, $a \in \mathbb{Z}$, and $b \in \mathbb{Z}_{>0}$. (Here, $\mathbb{Z}_{>0}$ denotes the set of positive integers.)

(a) For which positive numbers $n$ does there exist a sequence $x_1, x_2, ..., x_n$, which contains each of the numbers $1, 2, ..., n$ exactly once and for which $x_1 + x_2 +... + x_k$ is divisible by $k$ for each $k = 1, 2,...., n$? (b) Does there exist an infinite sequence $x_1, x_2, x_3, ..., $ which contains every positive integer exactly once and such that $x_1 + x_2 +... + x_k$ is divisible by $k$ for every positive integer $k$?

Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $(x,y)$ such that $(\text{i})$ $x$ and $y$ are relatively prime; $(\text{ii})$ $x$ divides $y^2+m;$ $(\text{iii})$ $y$ divides $x^2+m.$

Show that $1 + 1/2 + 1/3 + ... + 1/n$ is not an integer for $n > 1$.

For a positive integer $a$, $a'$ is the integer obtained by the following method: the decimal writing of $a'$ is the inverse of the decimal writing of $a$ (the decimal writing of $a'$ can begin by zeros, but not the one of $a$); for instance if $a=2370$, $a'=0732$, that is $732$. Let $a_{1}$ be a positive integer, and $(a_{n})_{n \geq 1}$ the sequence defined by $a_{1}$ and the following formula for $n \geq 1$: \[a_{n+1}=a_{n}+a'_{n}. \] Can $a_{7}$ be prime?

A Pythagorean triple is a solution of the equation $x^2 + y^2 = z^2$ in positive integers such that $x < y$. Given any non-negative integer $n$ , show that some positive integer appears in precisely $n$ distinct Pythagorean triples.

[b]p1.[/b] a) Given four points in the plane, no three of which lie on the same line, each subset of three points determines the vertices of a triangle. Can all these triangles have equal areas? If so, give an example of four points (in the plane) with this property, and then describe all arrangements of four joints (in the plane) which permit this. If no such arrangement exists, prove this. b) Repeat part a) with "five" replacing "four" throughout. [b]p2.[/b] Three people at the base of a long stairway begin a race up the stairs. Person A leaps five steps with each stride (landing on steps $5$, $10$, $15$, etc.). Person B leaps a little more slowly but covers six steps with each stride. Person C leaps seven steps with each stride. A picture taken near the end of the race shows all three landing simultaneously, with Person A twenty-one steps from the top, person B seven steps from the top, and Person C one step from the top. How many steps are there in the stairway? If you can find more than one answer, do so. Justify your answer. [b]p3. [/b]Let $S$ denote the sum of an infinite geometric series. Suppose the sum of the squares of the terms is $2S$, and that df the cubes is $64S/13$. Find the first three terms of the original series. [b]p4.[/b] $A$, $B$ and $C$ are three equally spaced points on a circular hoop. Prove that as the hoop rolls along the horizontal line $\ell$, the sum of the distances of the points $A, B$, and $C$ above line $\ell$ is constant. [img]https://cdn.artofproblemsolving.com/attachments/3/e/a1efd0975cf8ff3cf6acb1da56da1dce35d81e.png[/img] [b]p5.[/b] A set of $n$ numbers $x_1,x_2,x_3,...,x_n$ (where $n>1$) has the property that the $k^{th}$ number (that is, $x_k$ ) is removed from the set, the remaining $(n-1)$ numbers have a sum equal to $k$ (the subscript o $x_k$ ), and this is true for each $k = 1,2,3,...,n$. a) SoIve for these $n$ numbers b) Find whether at least one of these $n$ numbers can be an integer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For a polynomial $P(x)$ with integer coefficients and a prime $p$, if there is no $n \in \mathbb{Z}$ such that $p|P(n)$, we say that polynomial $P$ [i]excludes[/i] $p$. Is there a polynomial with integer coefficients such that having degree of 5, excluding exactly one prime and not having a rational root?

Let a, b, and c be nonzero integers. Show that there exists an integer k such that $$gcd\left(a+kb, c\right) = gcd\left(a, b, c\right)$$

Prove that for each positive integer $n$, there exists a positive integer with the following properties: It has exactly $n$ digits. None of the digits is 0. It is divisible by the sum of its digits.

Find all positive integers $m,n$ and prime numbers $p$ for which $\frac{5^m+2^np}{5^m-2^np}$ is a perfect square.

Find three distinct natural numbers such that the sum of their reciprocals is an integer.

Is it possible to find $2008$ infinite arithmetical progressions such that there exist finitely many positive integers not in any of these progressions, no two progressions intersect and each progression contains a prime number bigger than $2008$?

Let $a{}$ and $b>1$ be natural numbers. Prove that there exists a natural number $n < b^2$ such that the number $a^n + n$ is divisible by $b{}$.

Prove that for all positive integer $n$, there is a positive integer $m$ that $7^n | 3^m +5^m -1$.

Investigate if there exist infinitely many natural numbers $n$ such that $n$ divides $2^n+3^n$.

Do there exist 2018 positive irreducible fractions, each with a different denominator, so that the denominator of the difference of any two (after reducing the fraction) is less than the denominator of any of the initial 2018 fractions? (6 points) Maxim Didin

Consider an integer $n\geq 2$ and an odd prime $p$. Let $U$ be the set of all positive integers $($strictly$)$ less than $p^n$ that are not divisible by $p$, and let $N$ be the number of elements of $U$. Does there exist permutation $a_1,a_2,\cdots a_N$ of the numbers in $U$ such that the sum $\sum_{k=1}^N a_ka_{k+1}$,where $a_{N+1}=a_1$, be divisible by $p^{n-1}$ but not by $p^n$? $Alexander \ Ivanov \, Bulgaria$

We have $2012$ sticks with integer length, and sum of length is $n$. We need to have sticks with lengths $1,2,....,2012$. For it we can break some sticks ( for example from stick with length $6$ we can get $1$ and $4$). For what minimal $n$ it is always possible?

What is the remainder of $2025\wedge (2024\wedge (2022\wedge (2021\wedge (2020\wedge ...\wedge (2\wedge 1) . . .)))))$ when it is divided by $2023$? Here $\wedge$ is the exponential symbol, for example $2\wedge (3\wedge 2) = 2\wedge 9 = 512$. The power tower contains the integers from $2025$ to $1$ exactly once, except that the number $2023$ is missing.

Let $ABC$ be a triangle. Let $D$ be the midpoint of $\overline{BC}$, let $E$ be the midpoint of $\overline{AD}$, and let $F$ be the midpoint of $\overline{BE}$. Let $G$ be the point where the lines $AB$ and $CF$ intersect. What is the value of $\frac{AG}{AB}$?

Vaysha has a board with $999$ consecutive numbers written and $999$ labels of the form [i]"This number is [b]not [/b]divisible by $i$"[/i], for $i \in \{ 2,3, \dots ,1000 \} $. She places each label next to a number on the board, so that each number has exactly one label. For each true statement on the stickers, Vaysha gets a piece of candy. How many pieces of candy can Vaysha guarantee to win, regardless of the numbers written on the board, if she plays optimally?

Find positive integers n that satisfy the following two conditions: (a) the quotient obtained when $n$ is divided by $9$ is a positive three digit number, that has equal digits. (b) the quotient obtained when $n + 36$ is divided by $4$ is a four digit number, the digits beeing $2, 0, 0, 9$ in some order.

A frog starts at $0$ on a number line and plays a game. On each turn the frog chooses at random to jump $1$ or $2$ integers to the right or left. It stops moving if it lands on a nonpositive number or a number on which it has already landed. If the expected number of times it will jump is $\tfrac{p}{q}$ for relatively prime positive integers $p$ and $q$, find $p+q$. [i]Proposed by Michael Kural[/i]