Zachary tries to simplify the fraction $\frac{2020}{5050}$ by dividing the numerator and denominator by the same integer to get the fraction $\frac{m}{n}$ , where $m$ and $n$ are both positive integers. Find the sum of the (not necessarily distinct) prime factors of the sum of all the possible values of $m +n$

For positive integers $k,m$, where $1\le k\le 5$, define the function $f(m,k)$ as \[f(m,k)=\sum_{i=1}^{5}\left[m\sqrt{\frac{k+1}{i+1}}\right]\] where $[x]$ denotes the greatest integer not exceeding $x$. Prove that for any positive integer $n$, there exist positive integers $k,m$, where $1\le k\le 5$, such that $f(m,k)=n$.

Determine all positive integers $k$, $\ell$, $m$ and $n$, such that $$\frac{1}{k!}+\frac{1}{\ell!}+\frac{1}{m!} =\frac{1}{n!} $$

Given the rational numbers $r$, $q$, and $n$, such that $\displaystyle\frac1{r+qn}+\frac1{q+rn}=\frac1{r+q}$, prove that $\displaystyle\sqrt{\frac{n-3}{n+1}}$ is a rational number.

Find the smallest natural $ k $ such that among any $ k $ distinct and pairwise coprime naturals smaller than $ 2018, $ a prime can be found. [i]Vlad Robu[/i]

For fixed coprime positive integers $a,b$, define $n$ to be [i]bad[/i] if it is not of the form $$ax+by,\enspace x,y\in\mathbb N^*$$ Prove that there are finitely many bad positive integers. Also, find the sum of squares of them.

[b]p1.[/b] In triangle $ABC$, the median $BM$ is drawn. The length $|BM| = |AB|/2$. The angle $\angle ABM = 50^o$. Find the angle $\angle ABC$. [b]p2.[/b] Is there a positive integer $n$ which is divisible by each of $1, 2,3,..., 2018$ except for two numbers whose difference is$ 7$? [b]p3.[/b] Twenty numbers are placed around the circle in such a way that any number is the average of its two neighbors. Prove that all of the numbers are equal. [b]p4.[/b] A finite number of frogs occupy distinct integer points on the real line. At each turn, a single frog jumps by $1$ to the right so that all frogs again occupy distinct points. For some initial configuration, the frogs can make $n$ moves in $m$ ways. Prove that if they jump by $1$ to the left (instead of right) then the number of ways to make $n$ moves is also $m$. [b]p5.[/b] A square box of chocolates is divided into $49$ equal square cells, each containing either dark or white chocolate. At each move Alex eats two chocolates of the same kind if they are in adjacent cells (sharing a side or a vertex). What is the maximal number of chocolates Alex can eat regardless of distribution of chocolates in the box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. Let $S$ be a set of ordered pairs $(x, y)$ such that $1\leq x \leq n$ and $0 \leq y \leq n$ in each pair, and there are no pairs $(a, b)$ and $(c, d)$ of different elements in $S$ such that $a^2+b^2$ divides both $ac+bd$ and $ad - bc$. In terms of $n$, determine the size of the largest possible set $S$.

A rational number $x$ is given. Prove that there exists a sequence $x_0, x_1, x_2, \ldots$ of rational numbers with the following properties: (a) $x_0=x$; (b) for every $n\ge1$, either $x_n = 2x_{n-1}$ or $x_n = 2x_{n-1} + \textstyle\frac{1}{n}$; (c) $x_n$ is an integer for some $n$.

Show that the divisors of a number $n \ge 2$ can only be divided into two groups in which the product of the numbers is the same if the product of the divisors of $n$ is a square number.

Prove that the equation $x^3+y^3+z^3=t^4$ has infinitely many solutions in positive integers such that $\gcd(x,y,z,t)=1$. [i]Mihai Pitticari & Sorin Rǎdulescu[/i]

Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]

Let $ f: \mathbb{N} \rightarrow \mathbb{N} $ be a function from the positive integers to the positive integers for which $ f(1)=1,f(2n)=f(n) $ and $ f(2n+1)=f(n)+f(n+1) $ for all $ n\in \mathbb{N} $. Prove that for any natural number $ n $, the number of odd natural numbers $ m $ such that $ f(m)=n $ is equal to the number of positive integers not greater than $ n $ having no common prime factors with $ n $.

For each $1\leq i\leq 9$ and $T\in\mathbb N$, define $d_i(T)$ to be the total number of times the digit $i$ appears when all the multiples of $1829$ between $1$ and $T$ inclusive are written out in base $10$. Show that there are infinitely many $T\in\mathbb N$ such that there are precisely two distinct values among $d_1(T)$, $d_2(T)$, $\dots$, $d_9(T)$.

A hare and a tortoise run in the same direction, at constant but different speeds, around the base of a tall square tower. They start together at the same vertex, and the run ends when both return to the initial vertex simultaneously for the first time. Suppose the hare runs with speed 1, and the tortoise with speed less than 1. For what rational numbers $q{}$ is it true that, if the tortoise runs with speed $q{}$, the fraction of the entire run for which the tortoise can see the hare is also $q{}$?

Let $p$ a prime number and $r$ an integer such that $p|r^7-1$. Prove that if there exist integers $a, b$ such that $p|r+1-a^2$ and $p|r^2+1-b^2$, then there exist an integer $c$ such that $p|r^3+1-c^2$.

Can the positive integers be partitioned into $12$ subsets such that for each positive integer $k$, the numbers $k, 2k,\ldots,12k$ belong to different subsets?

Find the largest positive integer $N$ such that the number of integers In the set ${1,2,3,...,N}$ which are divisible by $3$ is equal to the number of integers which are divisible by $5$ or $7$ (or both),

Let $p_1, p_2, ..., p_k$ be $k$ different primes. We consider all positive integers that use only these primes (not necessarily all) in their prime factorization, and arrange those numbers in increasing order, forming an infinite sequence: $a_1 < a_2 < ... < a_n < ...$ Prove that, for every number $c$, there exists $n$ such that $a_{n+1} -a_n > c$.

Let $a, b, c$ be two-digit, three-digit, and four-digit numbers, respectively. Assume that the sum of all digits of number $a+b$, and the sum of all digits of $b + c$ are all equal to $2$. The largest value of $a + b + c$ is (A): $1099$ (B): $2099$ (C): $1199$ (D): $2199$ (E): None of the above.

Determine the greatest number, who is the product of some positive integers, and the sum of these numbers is $1976.$

A dart board looks like three concentric circles with radii of 4, 6, and 8. Three darts are thrown at the board so that they stick at three random locations on then board. The probability that one dart sticks in each of the three regions of the dart board is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $n$ and $z$ be integers greater than $1$ and $(n,z)=1$. Prove: (a) At least one of the numbers $z_i=1+z+z^2+\cdots +z^i,\ i=0,1,\ldots ,n-1,$ is divisible by $n$. (b) If $(z-1,n)=1$, then at least one of the numbers $z_i$ is divisible by $n$.

Let $n\not\equiv 2\pmod{3}$. Is $\sqrt{\lfloor n+\tfrac {2n}{3}\rfloor+7},\forall n \in \mathbb {N}$, a natural number?

We take $100$ consecutive natural numbers $a_{1},$ $a_{2},$ $...,$ $a_{100}.$ Determine the last two digits of the number $a_{1}^{8}+a_{2}^{8}+...+a_{100}^{8}.$