Let $n, m, k$ and $l$ be positive integers with $n \neq 1$ such that $n^k + mn^l + 1$ divides $n^{k+l} - 1$. Prove that [list] [*]$m = 1$ and $l = 2k$; or [*]$l|k$ and $m = \frac{n^{k-l}-1}{n^l-1}$. [/list]

Find the three-digit positive integer $n$ for which $\binom n3 \binom n4 \binom n5 \binom n6 $ is a perfect square.

Find all natural numbers $n$ for which equality holds $n + d (n) + d (d (n)) +... = 2021$, where $d (0) = d (1) = 0$ and for $k> 1$, $ d (k)$ is the [i]superdivisor [/i] of the number $k$ (i.e. its largest divisor of $d$ with property $d <k$). (Tomáš Bárta)

Let $n$ be a positive integer. On a board there are written all integers from $1$ to $n$. Alina does $n$ moves consecutively: for every integer $m$ $(1 \leq m \leq n)$ the move $m$ consists in changing the sign of every number divisible by $m$. At the end Alina sums the numbers. Find this sum.

For a natural number $n$, set $S_n$ is defined as: \[S_n = \left \{ {n\choose n}, {2n \choose n}, {3n\choose n},..., {n^2 \choose n} \right \}.\] a) Prove that there are infinitely many composite numbers $n$, such that the set $S_n$ is not complete residue system mod $n$; b) Prove that there are infinitely many composite numbers $n$, such that the set $S_n$ is complete residue system mod $n$.

Suppose that $f : Z\times Z \to R$, satisfies the equation $f(x, y) = f(3x+y, 2x+ 2y)$ for all $x, y \in Z$. Determine the maximal number of distinct values of $f(x, y)$ for $1 \le x, y \le 100$.

Show that the sequence \[\binom{2002}{2002},\binom{2003}{2002},\binom{2004}{2002},\ldots \] considred modulo $2002$, is periodic.

From a set containing $6$ positive and consecutive integers they are extracted, randomly and with replacement, three numbers $a, b, c$. Determine the probability that even $a^b + c$ generates as a result .

Set $ M= \{1,2,\cdots,2550\} $ and $\min A ,\ \max A $ represents the minimum and maximum values of the elements in the set $A$. For $ k \in \{1,2,\cdots 2006\} $define $$ x_k = \frac{1}{2008} \bigg (\sum_{A \subset M : n(A)= k} (\ min A + \max A) \, \bigg) $$. Find remainder from division $\sum_{i=1}^{2006} x_i^2$ with $2551$. [i](passer-by)[/i]

[b]p1.[/b] In their class Introduction to Ladders at Greendale Community College, Jan takes four tests. They realize that their test scores in chronological order form a strictly increasing arithmetic progression with integer terms, and that the average of those scores is an integer greater than or equal to $94$. How many possible combinations of test scores could they have had? (Test scores at Greendale range between $0$ and $100$, inclusive.) [b]p2.[/b] Suppose that $A$ and $B$ are digits between $1$ and $9$ such that $$0.\overline{ABABAB...}+ B \cdot (0.\overline{AAA...}) = A \cdot (0.\overline{B1B1B1...}) + 1$$ Find the sum of all possible values of $10A + B$. [b]p3.[/b] Let $ABC$ be an isosceles right triangle with $m\angle ABC = 90^o$. Let $D$ and $E$ lie on segments $\overline{AC}$ and $\overline{BC}$, respectively, such that triangles $\vartriangle ADB$ and $\vartriangle CDE$ are similar and $DE =EB$. If $\frac{AC}{AD} = 1 +\frac{\sqrt{a}}{b}$ with $a$, $b$ positive integers and $a$ squarefree, then find $a + b$. [b]p4.[/b] Five bowling pins $P_1, P_2, ..., P_5$ are lined up in a row. Each turn, Jemma picks a pin at random from the standing pins, and throws a bowling ball at that pin; that pin and each pin directly adjacent to it are knocked down. If the expected value of the number of turns Jemma will take to knock down all the pins is $\frac{a}{b}$ where $a$ and $b$ are relatively prime, find $a + b$. (Pins $P_i$ and $P_j$ are adjacent if and only if $|i - j| = 1$.) [b]p5.[/b] How many terms in the expansion of $$(1 + x + x^2 + x^3 +... + x^{2021})(1 + x^2 + x^4 + x^6 + ... + x^{4042})$$ have coeffcients equal to $1011$? [b]p6.[/b] Suppose $f(x)$ is a monic quadratic polynomial with distinct nonzero roots $p$ and $q$, and suppose $g(x)$ is a monic quadratic polynomial with roots $p + \frac{1}{q}$ and $q + \frac{1}{p}$ . If we are given that $g(-1) = 1$ and $f(0)\ne -1$, then there exists some real number $r$ that must be a root of $f(x)$. Find $r$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m,n\geq2$ be positive integers, and let $a_1,a_2,\ldots ,a_n$ be integers, none of which is a multiple of $m^{n-1}$. Show that there exist integers $e_1,e_2,\ldots,e_n$, not all zero, with $\left|{\,e}_i\,\right|<m$ for all $i$, such that $e_1a_1+e_2a_2+\,\ldots\,+e_na_n$ is a multiple of $m^n$.

Find four positive integers each not exceeding $70000$ and each having more than $100$ divisors.

What is the greatest common divisor of the set of numbers \[\{{16}^{n}+10n-1 \; \vert \; n=1,2,\cdots \}?\]

A positive integer n is called [i]primary divisor [/i] if for every positive divisor $d$ of $n$ at least one of the numbers $d - 1$ and $d + 1$ is prime. For example, $8$ is divisor primary, because its positive divisors $1$, $2$, $4$, and $8$ each differ by $1$ from a prime number ($2$, $3$, $5$, and $7$, respectively), while $9$ is not divisor primary, because the divisor $9$ does not differ by $1$ from a prime number (both $8$ and $10$ are composite). Determine the largest primary divisor number.

Prove that there exists a succession $a_1, a_2, ... , a_k, ...$, where each $a_i$ is a digit ($a_i \in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)$ ) and $a_0=6$, such that, for each positive integrer $n$, the number $x_n=a_0+10a_1+100a_2+...+10^{n-1}a_{n-1}$ verify that $x_n^2-x_n$ is divisible by $10^n$.

By $h(n)$, where $n$ is an integer greater than $1$, let us denote the greatest prime divisor of the number $n$. Are there infinitely many numbers $n$ for which $h(n) < h(n+1)< h(n+2)$ holds?

Prove that the number $a =\overline{{1...1}{5...5}6}$ is a perfect square (where $1$s are $2012$ in total and $5$s are $2011$ in total)

A set of five-digit numbers $\{N_1,... ,N_k\}$ is such that any five-digit a number whose digits are all in ascending order is the same in at least one digit with at least one of the numbers $N_1$,$...$ ,$N_k$. Find the smallest possible value of $k$.

We are given that $a, b$ and $c$ are whole numbers (i.e. positive integers) . Prove that if $a = b + c$ then $a^4 + b^4 + c^4$ is double the square of a whole number. (Folklore)

[b]p1. [/b] Evaluate $S$. $$S =\frac{10000^2 - 1}{\sqrt{10000^2 - 19999}}$$ [b]p2. [/b] Starting on a triangular face of a right triangular prism and allowing moves to only adjacent faces, how many ways can you pass through each of the other four faces and return to the first face in five moves? [b]p3.[/b] Given that $$(a + b) + (b + c) + (c + a) = 18$$ $$\frac{1}{a + b}+\frac{1}{b + c}+ \frac{1}{c + a}=\frac59,$$ determine $$\frac{c}{a + b}+\frac{a}{b + c}+\frac{b}{c + a}.$$ [b]p4.[/b] Find all primes $p$ such that $2^{p+1} + p^3 - p^2 - p$ is prime. [b]p5.[/b] In right triangle $ABC$ with the right angle at $A$, $AF$ is the median, $AH$ is the altitude, and $AE$ is the angle bisector. If $\angle EAF = 30^o$ , find $\angle BAH$ in degrees. [b]p6.[/b] For which integers $a$ does the equation $(1 - a)(a - x)(x- 1) = ax$ not have two distinct real roots of $x$? [b]p7. [/b]Given that $a^2 + b^2 - ab - b +\frac13 = 0$, solve for all $(a, b)$. [b]p8. [/b] Point $E$ is on side $\overline{AB}$ of the unit square $ABCD$. $F$ is chosen on $\overline{BC}$ so that $AE = BF$, and $G$ is the intersection of $\overline{DE}$ and $\overline{AF}$. As the location of $E$ varies along side $\overline{AB}$, what is the minimum length of $\overline{BG}$? [b]p9.[/b] Sam and Susan are taking turns shooting a basketball. Sam goes first and has probability $P$ of missing any shot, while Susan has probability $P$ of making any shot. What must $P$ be so that Susan has a $50\%$ chance of making the first shot? [b]p10.[/b] Quadrilateral $ABCD$ has $AB = BC = CD = 7$, $AD = 13$, $\angle BCD = 2\angle DAB$, and $\angle ABC = 2\angle CDA$. Find its area. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that none of the digits $2$, $4$, $7$, $9$ can be the last digit of a number $$ 1 + 2 + 3 + \ldots + n,$$ where $n$ is a natural number.

Prove that for every $n$ there exists a solution of the equation $$a^2 +b^2 +c^2 = 3abc$$ in natural numbers $a,b,c$ greater than $n$.

Let $c_n$ be the first digit of $2^n$ (in decimal representation). Prove that the number of different $13$-tuples $< c_k$,$...$, $c_{k+12}>$ is equal to $57$. (AY Belov,)

Suppose $ABC$ is a triangle inscribed in circle $\omega$ . Let $A'$ be the point on $\omega$ so that $AA'$ is a diameter, and let $G$ be the centroid of $ABC$. Given that $AB = 13$, $BC = 14$, and $CA = 15$, let $x$ be the area of triangle $AGA'$ . If $x$ can be expressed in the form $m/n$ , where m and n are relatively prime positive integers, compute $100n + m$.

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.