Let $a$ be a positive integer. We say that a positive integer $b$ is [i]$a$-good[/i] if $\tbinom{an}{b}-1$ is divisible by $an+1$ for all positive integers $n$ with $an \geq b$. Suppose $b$ is a positive integer such that $b$ is $a$-good, but $b+2$ is not $a$-good. Prove that $b+1$ is prime.

Find the minimum number of perfect cubes such that their sum is equal to $ 346^{346} . $

For each positive integer $k,$ let $t(k)$ be the largest odd divisor of $k.$ Determine all positive integers $a$ for which there exists a positive integer $n,$ such that all the differences \[t(n+a)-t(n); t(n+a+1)-t(n+1), \ldots, t(n+2a-1)-t(n+a-1)\] are divisible by 4. [i]Proposed by Gerhard Wöginger, Austria[/i]

The numbers $1,2,3,\dots,2017$ are on the blackboard. Amelie and Boris take turns removing one of those until only two numbers remain on the board. Amelie starts. If the sum of the last two numbers is divisible by $8$, then Amelie wins. Else Boris wins. Who can force a victory?

Find all natural numbers $n$ for which there is a permutation $(p_1,p_2,...,p_n)$ of numbers $(1,2,...,n)$ such that sets $\{p_1 +1, p_2 + 2,..., p_n +n\}$ and $\{p_1-1, p_2-2,...,p_n -n\}$ are complete residue systems $\mod n$.

Find all pairs of positive integers $(a,b)$ such that $8b+1$ is a multiple of $a$ and $8a+1$ is a multiple of $b$.

A clue “$k$ digits, sum is $n$” gives a number k and the sum of $k$ distinct, nonzero digits. An answer for that clue consists of $k$ digits with sum $n$. For example, the clue “Three digits, sum is $23$” has only one answer: $6,8,9$. The clue “Three digits, sum is $8$” has two answers: $1,3,4$ and $1,2,5$. If the clue “Four digits, sum is $n$” has the largest number of answers for any four-digit clue, then what is the value of $n$? How many answers does this clue have? Explain why no other four-digit clue can have more answers.

Verify that, for each $r \ge 1$, there are infinitely many primes $p$ with $p \equiv 1 \; \pmod{2^r}$.

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

Find all positive integers $n$ such that $4^n+6^n+9^n$ is a square. [i]David Yang, Alex Zhu.[/i]

Find all $n$ natural numbers such that for each of them there exist $p , q$ primes such that these terms satisfy. $1.$ $p+2=q$ $2.$ $2^n+p$ and $2^n+q$ are primes.

For any given integers $m,n$ such that $2\leq m<n$ and $(m,n)=1$. Determine the smallest positive integer $k$ satisfying the following condition: for any $m$-element subset $I$ of $\{1,2,\cdots,n\}$ if $\sum_{i\in I}i> k$, then there exists a sequence of $n$ real numbers $a_1\leq a_2 \leq \cdots \leq a_n$ such that $$\frac1m\sum_{i\in I} a_i>\frac1n\sum_{i=1}^na_i$$

[b]p1.[/b] Suppose $x \ne 1$ or $10$ and logarithms are computed to the base $10$. Define $y= 10^{\frac{1}{1-\log x}}$ and $z = ^{\frac{1}{1-\log y}}$ . Prove that $x= 10^{\frac{1}{1-\log z}}$ [b]p2.[/b] If $n$ is an odd number and $x_1, x_2, x_3,..., x_n$ is an arbitrary arrangement of the integers $1, 2,3,..., n$, prove that the product $$(x_1 -1)(x_2-2)(x_3- 3)... (x_n-n)$$ is an even number (possibly negative or zero). [b]p3.[/b] Prove that $\frac{1 \cdot 3 \cdot 5 \cdot \cdot \cdot (2n-1)}{2 \cdot 4 \cdot 6 \cdot \cdot \cdot(2n} < \sqrt{\frac{1}{2n + 1}}$ for all integers $n = 1,2,3,...$ [b]p4.[/b] Prove that if three angles of a convex polygon are each $60^o$, then the polygon must be an equilateral triangle. [b]p5.[/b] Find all solutions, real and complex, of $$4 \left(x^2+\frac{1}{x^2} \right)-4 \left( x+\frac{1}{x} \right)-7=0$$ [b]p6.[/b] A man is $\frac38$ of the way across a narrow railroad bridge when he hears a train approaching at $60$ miles per hour. No matter which way he runs he can [u]just [/u] escape being hit by the train. How fast can he run? Prove your assertion. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a positive integer $N$, define $u(N)$ as the number obtained by making the ones digit the left-most digit of $N$, that is, taking the last, right-most digit (the ones digit) and moving it leftwards through the digits of $N$ until it becomes the first (left-most) digit; for example, $u(2023) = 3202$. [b](1)[/b] Find a $6$-digit positive integer $N$ such that \[\frac{u(N)}{N} = \frac{23}{35}.\] [b](2)[/b] Prove that there is no positive integer $N$ with less than $6$ digits such that \[\frac{u(N)}{N} = \frac{23}{35}.\]

Let $a_1,a_2,...,a_m(m\geq 1)$ be all the positive divisors of $n$. If there exist $m$ integers $b_1,b_2,...b_m$ such that $n=\sum_{i=1}^m (-1)^{b_i} a_i$, then $n$ is a $\textit{good}$ number. Prove that there exist a good number with exactly $2013$ distinct prime factors.

Find all possible triples $(a, b, c)$ of positive integers with the following properties: • $gcd(a, b) = gcd(a, c) = gcd(b, c) = 1$, • $a$ is a divisor of $a + b + c$, • $b$ is a divisor of $a + b + c$, • $c$ is a divisor of $a + b + c$. (Here $gcd(x,y)$ is the greatest common divisor of $x$ and $y$.)

Find all positive integers $a$, $b$, $n$ and prime numbers $p$ that satisfy \[ a^{2013} + b^{2013} = p^n\text{.}\] [i]Proposed by Matija Bucić.[/i]

Let $a$ and $n>0$ be integers. Define $a_{n} = 1+a+a^2...+a^{n-1}$. Show that if $p|a^p-1$ for all prime divisors of $n_{2}-n_{1}$, then the number $\frac{a_{n_{2}}-a_{n_{1}}}{n_{2}-n_{1}}$ is an integer.

The points $A,B,C,D$ lie, in this order, on a circle $\omega$, where $AD$ is a diameter of $\omega$. Furthermore, $AB=BC=a$ and $CD=c$ for some relatively prime integers $a$ and $c$. Show that if the diameter $d$ of $\omega$ is also an integer, then either $d$ or $2d$ is a perfect square.

For which $ n \geq 2, n \in \mathbb{N}$ are there positive integers $ A_1, A_2, \ldots, A_n$ which are not the same pairwise and have the property that the product $ \prod^n_{i \equal{} 1} (A_i \plus{} k)$ is a power for each natural number $ k.$

Prove that if $a,b,c,d$ are nonnegative integers satisfying $(a+b)^2+2a+b= (c+d)^2+2c+d$, then $a = c $ and $b = d$. Show that the same is true if $a,b,c,d$ satisfy $(a+b)^2+3a+b=(c+d)^2+3c+d$, but show that there exist $a,b,c,d $ with $a \ne c$ and $b \ne d$ satisfying $(a+b)^2+4a+b = (c+d)^2+4c+d$.

Let $a$ be a positive number, and we show decimal part of the $a$ with $\left\{a\right\}$.For a positive number $x$ with $\sqrt 2< x <\sqrt 3$ such that, $\left\{\frac{1}{x}\right\}$=$\left\{x^2\right\}$.Find value of the $$x(x^7-21)$$

Let positive integers $a,\ b,\ c$ be pairwise coprime. Denote by $g(a, b, c)$ the maximum integer not representable in the form $xa+yb+zc$ with positive integral $x,\ y,\ z$. Prove that \[ g(a, b, c)\ge \sqrt{2abc}\] [i](M. Ivanov)[/i] [hide="Remarks (containing spoilers!)"] 1. It can be proven that $g(a,b,c)\ge \sqrt{3abc}$. 2. The constant $3$ is the best possible, as proved by the equation $g(3,3k+1,3k+2)=9k+5$. [/hide]

Answer the following two questions and justify your answers: (a) What is the last digit of the sum $1^{2012}+2^{2012}+3^{2012}+4^{2012}+5^{2012}$? (b) What is the last digit of the sum $1^{2012}+2^{2012}+3^{2012}+4^{2012}+...+2011^{2012}+2012^{2012}$?

Find the 2002nd positive integer that is not the difference of two square integers