Find the sum of all positive integers $n$ where the mean and median of $\{20, 42, 69, n\}$ are both integers. [i]Proposed by bissue[/i]

Let $k\geqslant 2$ be an integer, and $a,b$ be real numbers. prove that $a-b$ is an integer divisible by $k$ if and only if for every positive integer $n$ $$\lfloor an \rfloor \equiv \lfloor bn \rfloor \ (mod \ k)$$ Proposed by Navid Safaei

Let $a$ and $b$ be integers and $p$ a prime. For each positive integer k, define$ A_k = \{n \in Z^+ |p^k$ divides $a^n - b^n\}$. Show that if $A_1$ is nonempty then $A_k$ is nonempty for all positive integers $k$

Prove that there exists a positive integer $n$, such that the remainder of $3^n$ when divided by $2^n$ is greater than $10^{2021} $.

More than five competitors participated in a chess tournament. Each competitor played exactly once against each of the other competitors. Five of the competitors they each lost exactly two games. All other competitors each won exactly three games. There were no draws in the tournament. Determine how many competitors there were and show a tournament that verifies all conditions.

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

Find all ordered pairs $(a,b)$ of positive integers for which the numbers $\dfrac{a^3b-1}{a+1}$ and $\dfrac{b^3a+1}{b-1}$ are both positive integers.

In an old script found in ruins of Perspolis is written: [code] This script has been finished in a year whose 13th power is 258145266804692077858261512663 You should know that if you are skilled in Arithmetics you will know the year this script is finished easily.[/code] Find the year the script is finished. Give a reason for your answer.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

Given two primes $p$ and $q$, is $v_p(q^n+n^q)$ unbounded as $n$ varies? [i](Proposed by Ivan Chan Kai Chin)[/i]

The sequence $ (F_n)$ of Fibonacci numbers satisfies $ F_1 \equal{} 1, F_2 \equal{} 1$ and $ F_n \equal{} F_{n\minus{}1} \plus{}F_{n\minus{}2}$ for all $ n \ge 3$. Find all pairs of positive integers $ (m, n)$, such that $ F_m . F_n \equal{} mn$.

[b]p1.[/b] (a) Find three positive integers $a, b, c$ whose sum is $407$, and whose product (when written in base $10$) ends in six $0$'s. (b) Prove that there do NOT exist positive integers $a, b, c$ whose sum is $407$ and whose product ends in seven $0$'s. [b]p2.[/b] Three circles, each of radius $r$, are placed on a plane so that the center of each circle lies on a point of intersection of the other two circles. The region $R$ consists of all points inside or on at least one of these three circles. Find the area of $R$. [b]p3.[/b] Let $f_1(x) = a_1x^2+b_1x+c_1$, $f_2(x) = a_2x^2+b_2x+c_2$ and $f_3(x) = a_3x^2+b_3x+c_3$ be the equations of three parabolas such that $a_1 > a_2 > a-3$. Prove that if each pair of parabolas intersects in exactly one point, then all three parabolas intersect in a common point. [b]p4.[/b] Gigafirm is a large corporation with many employees. (a) Show that the number of employees with an odd number of acquaintances is even. (b) Suppose that each employee with an even number of acquaintances sends a letter to each of these acquaintances. Each employee with an odd number of acquaintances sends a letter to each non-acquaintance. So far, Leslie has received $99$ letters. Prove that Leslie will receive at least one more letter. (Notes: "acquaintance" and "non-acquaintance" refer to employees of Gigaform. If $A$ is acquainted with $B$, then $B$ is acquainted with $A$. However, no one is acquainted with himself.) [b]p5.[/b] (a) Prove that for every positive integer $N$, if $A$ is a subset of the numbers $\{1, 2, ...,N\}$ and $A$ has size at least $2N/3 + 1$, then $A$ contains a three-term arithmetic progression (i.e., there are positive integers $a$ and $b$ so that all three of the numbers $a$,$a + b$, and $a + 2b$ are elements of $A$). (b) Show that if $A$ is a subset of $\{1, 2, ..., 3500\}$ and $A$ has size at least $2003$, then $A$ contains a three-term arithmetic progression. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let be given a positive integer $n \ge 3$. Consider integers $a_1,a_2,...,a_n >1$ with the product equals to $A$ such that: for each $k \in \{1, 2,..., n\}$ then the remainder when $\frac{A}{a_k}$ divided by $a_k$ are all equal to $r$. Prove that $r \le n- 2$

Find all primes $p$ and $q$, with $p \le q$, so that $$p (2q + 1) + q (2p + 1) = 2 (p^2 + q^2).$$

a) Is it possible that the sum of all the positive divisors of two different natural numbers are equal? b) Is it possible that the product of all the positive divisors of two different natural numbers are equal?

Let $x$ and $y$ be positive integers. If ${x^{2^n}}-1$ is divisible by $2^ny+1$ for every positive integer $n$, prove that $x=1$.

Find all positive integers $m, n$ such that $\frac{2m-1}{n}$ and $\frac{2n-1}{m}$ are both integers.

Find all natural numbers whose decimal notation consists of different digits of the same parity and which are perfect squares.

Let $x$ satisfy $(6x + 7) + (8x + 9) = (10 + 11x) + (12 + 13x).$ There are relatively prime positive integers so that $x = -\tfrac{m}{n}$. Find $m + n.$

There are a buch of 2000 stones. Two players play alternatively, following the next rules: ($a$)On each turn, the player can take 1, 2, 3, 4 or 5 stones [b]of[/b] the bunch. ($b$) On each turn, the player has forbidden to take the exact same amount of stones that the other player took just before of him in the last play. The loser is the player who can't make a valid play. Determine which player has winning strategy and give such strategy.

For every positive integer $n$, find the maximum power of $2$ that divides the number $$1 + 2019 + 2019^2 + 2019^3 +.. + 2019^{n-1}.$$

If we add $1996$ to $1997$, we first add the unit digits $6$ and $7$. Obtaining $13$, we write down $3$ and “carry” $1$ to the next column. Thus we make a carry. Continuing, we see that we are to make three carries in total. Does there exist a positive integer $k$ such that adding $1996\cdot k$ to $1997\cdot k$ no carry arises during the whole calculation?

Find the sum of all positive integers whose largest proper divisor is $55$. (A proper divisor of $n$ is a divisor that is strictly less than $n$.)

Find the $2019$th strictly positive integer $n$ such that $\binom{2n}{n}$ is not divisible by $5$.

A nonnegative integer $n$ is said to be $\textit{squarish}$ is it satisfies the following conditions: $\textbf{(i)}$ it contains no digits of $9$; $\textbf{(ii)}$ no matter how we increase exactly one of its digits with $1$, the outcome is a square. Find all squarish nonnegative integers. $\textit{(Vlad Robu)}$