Suppose that $ p$ is a prime number. Prove that for each $ k$, there exists an $ n$ such that: \[ \left(\begin{array}{c}n\\ \hline p\end{array}\right)\equal{}\left(\begin{array}{c}n\plus{}k\\ \hline p\end{array}\right)\]

For every integer $n\geq 3$, let $s_n$ be the sum of all primes (strictly) less than $n$. Are there infinitely many integers $n\geq 3$ such that $s_n$ is coprime to $n$? [i]Russian Competition[/i]

Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, the number $n^p-p$ is not divisible by $q$.

Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?

The following sequence lists all the positive rational numbers that do not exceed $\frac12$ by first listing the fraction with denominator 2, followed by the one with denominator 3, followed by the two fractions with denominator 4 in increasing order, and so forth so that the sequence is \[ \frac12,\frac13,\frac14,\frac24,\frac15,\frac25,\frac16,\frac26,\frac36,\frac17,\frac27,\frac37,\cdots. \] Let $m$ and $n$ be relatively prime positive integers so that the $2012^{\text{th}}$ fraction in the list is equal to $\frac{m}{n}$. Find $m+n$.

Show that for every integer $n \geq 2$ the number $$a=n^{5n-1}+n^{5n-2}+n^{5n-3}+n+1$$ is a composite number.

Find all functions $f$ from positive integers to themselves such that: 1)$f(mn)=f(m)f(n)$ for all positive integers $m, n$ 2)$\{1, 2, ..., n\}=\{f(1), f(2), ... f(n)\}$ is true for infinitely many positive integers $n$.

A polynomial $P(x)$ is called [i]nice[/i] if $P(0) = 1$ and the nonzero coefficients of $P(x)$ alternate between $1$ and $-1$ when written in order. Suppose that $P(x)$ is nice, and let $m$ and $n$ be two relatively prime positive integers. Show that \[Q(x) = P(x^n) \cdot \frac{(x^{mn} - 1)(x-1)}{(x^m-1)(x^n-1)}\] is nice as well.

Let $f:\mathbb{Z}_{+}\rightarrow\mathbb{Z}_{+}$ is one to one and bijective function. Prove that $f(mn)=f (m)f (n)$ if and only if $lcm (f (m),f (n))=f(lcm(m,n)) $

Let $a, b, c$ be positive integers such that $$\gcd(a, b) + \text{lcm}(a, b) = \gcd(a, c) + \text{lcm}(a, c).$$ Does it follow from this that $b = c$?

Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n$, where $m$ and $n$ are relatively prime positive integers. What are the last three digits of $m + n$?

Find all positive integers $a, b, c$, such that $(8a-5b)^2 + (3b-2c)^2 + (3c-7a)^2 = 2$.

Prove that a prime $p$ is expressible in the form $x^2+3y^2;x,y\in Z$ if and only if it is expressible in the form $ m^2+mn+n^2;m,n \in Z$.Can $p$ be replaced by a natural number $n$?

Bob plays a game on the whiteboard. Initially, the numbers $\{1, 2, ...,n\}$ are shown. On each turn, Bob takes two numbers from the board $x$, $y$, erases them both, and writes down $2x + y$ onto the board. In terms of n, what is the maximum possible value that Bob can end up with?

In the coordinate plane a parabola passes through the points $(7,6)$, $(7,12)$, $(18,19)$, and $(18,48)$. The axis of symmetry of the parabola is a line with slope $\tfrac{r}{s}$ where r and s are relatively prime positive integers. Find $r + s$.

[b]p1.[/b] Suppose Mitchell has a fair die. He is about to roll it six times. The probability that he rolls $1$, $2$, $3$, $4$, $5$, and then $6$ in that order is $p$. The probability that he rolls $2$, $2$, $4$, $4$, $6$, and then $6$ in that order is $q$. What is $p - q$? [b]p2.[/b] What is the smallest positive integer $x$ such that $x \equiv 2017$ (mod $2016$) and $x \equiv 2016$ (mod $2017$) ? [b]p3.[/b] The vertices of triangle $ABC$ lie on a circle with center $O$. Suppose the measure of angle $ACB$ is $45^o$. If $|AB| = 10$, then what is the distance between $O$ and the line $AB$? [b]p4.[/b] A “word“ is a sequence of letters such as $YALE$ and $AELY$. How many distinct $3$-letter words can be made from the letters in $BOOLABOOLA$ where each letter is used no more times than the number of times it appears in $BOOLABOOLA$? [b]p5.[/b] How many distinct complex roots does the polynomial $p(x) = x^{12} - x^8 - x^4 + 1$ have? [b]p6.[/b] Notice that $1 = \frac12 + \frac13 + \frac16$ , that is, $1$ can be expressed as the sum of the three fractions $\frac12 $, $\frac13$ , and $\frac16$ , where each fraction is in the form $\frac{1}{n}$, with each $n$ different. Give a $6$-tuple of distinct positive integers $(a, b, c, d, e, f)$ where $a < b < c < d < e < f$ such that $\frac{1}{a} +\frac{1}{b} + \frac{1}{c} + \frac{1}{d} + \frac{1}{e} + \frac{1}{f} = 1$ and explain how you arrived at your $6$-tuple. Multiple answers will be accepted. [b]p7.[/b] You have a Monopoly board, an $11 \times 11$ square grid with the $9 \times 9$ internal square grid removed, where every square is blank except for Go, which is the square in the bottom right corner. During your turn, you determine how many steps forward (which is in the counterclockwise direction) to move by rolling two standard $6$-sided dice. Let $S$ be the set of squares on the board such that if you are initially on a square in $S$, no matter what you roll with the dice, you will always either land on Go (move forward enough squares such that you end up on Go) or you pass Go (you move forward enough squares such that you step on Go during your move and then you advance past Go). You randomly and uniformly select one square in $S$ as your starting position. What is the probability that you land on Go? [b]p8.[/b] Using $L$-shaped triominos, and dominos, where each square of a triomino and a domino covers one unit, what is the minimum number of tiles needed to cover a $3$-by-$2017$ rectangle without any gaps? [b]p9.[/b] Does there exist a pair of positive integers $(x, y)$, where $x < y$, such that $x^2 + y^2 = 1009^3$? If so, give a pair $(x, y)$ and explain how you found that pair. If not, explain why. [b]p10.[/b] Triangle $ABC$ has inradius $8$ and circumradius $20$. Let $M$ be the midpoint of side $BC$, and let $N$ be the midpoint of arc $BC$ on the circumcircle not containing $A$. Let $s_A$ denote the length of segment $MN$, and define $s_B$ and $s_C$ similarly with respect to sides $CA$ and $AB$. Evaluate the product $s_As_Bs_C$. [b]p11.[/b] Julia and Dan want to divide up $256$ dollars in the following way: in the first round, Julia will offer Dan some amount of money, and Dan can choose to accept or reject the offer. If Dan accepts, the game is over. Otherwise, if Dan rejects, half of the money disappears. In the second round, Dan can offer Julia part of the remaining money. Julia can then choose to accept or reject the offer. This process goes on until an offer is accepted or until $4$ rejections have been made; once $4$ rejections are made, all of the money will disappear, and the bargaining process ends. If Julia or Dan is indifferent between accepting and rejecting an offer, they will accept the offer. Given that Julia and Dan are both rational and both have the goal of maximizing the amount of money they get, how much will Julia offer Dan in the first round? [b]p12.[/b] A perfect partition of a positive integer $N$ is an unordered set of numbers (where numbers can be repeated) that sum to $N$ with the property that there is a unique way to express each positive integer less than $N$ as a sum of elements of the set. Repetitions of elements of the set are considered identical for the purpose of uniqueness. For example, the only perfect partitions of $3$ are $\{1, 1, 1\}$ and $\{1, 2\}$. $\{1, 1, 3, 4\}$ is NOT a perfect partition of $9$ because the sum $4$ can be achieved in two different ways: $4$ and $1 + 3$. How many integers $1 \le N \le 40$ each have exactly one perfect partition? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]6.[/b] Prove or disprove the following two propositions: [b](i)[/b] If $a$ and $b$ are positive integers such that $a<b$, then in any set of $b$ consecutive integers there are two whose product is divisible by $ab$ [b](ii)[/b] If $a,b$ and $c$ are positive integers such that $a<b<c$, then in any set of $c$ consecutive integers there are three whose product is divisible by $abc$. [b](N.8)[/b]

Let's consider all possible natural seven-digit numbers, in the decimal notation of which the numbers $1$, $2$, $3$, $4$, $5$, $6$, $7$ are used once each. Let's number these numbers in ascending order. What number will be the $1995th$ ?

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

$a,b,c$ are non-negative integers. Solve: $a!+5^b=7^c$ [i]Proposed by Serbia[/i]

Proce that number $$\underbrace{11...11}_{2n \,\, digits}-\underbrace{22 ... 22}_{n \,\, digits}$$ is, for every natural $n$, a perfect square.

Find all the pairs $(a,b)$ of integer numbers such that: $\triangleright$ $a-b-1|a^2+b^2$ $\triangleright$ $\frac{a^2+b^2}{2ab-1}=\frac{20}{19}$

Let \[P(m)=\frac{m}{2} + \frac{m^2}{4}+ \frac{m^4}{8} + \frac{m^8}{8}.\] How many of the values of $P(2022)$, $P(2023)$, $P(2024)$, and $P(2025)$ are integers? $ \textbf{(A) }0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4 \qquad $

Prove that $2^{n - 1}$ divides $n!$ if and only if $n = 2^{k - 1}$ for some positive integer $k$.

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?