Jonathan finds all ordered triples $(a, b, c)$ of positive integers such that $abc = 720$. For each ordered triple, he writes their sum $a + b + c$ on the board. (Numbers may appear more than once.) What is the sum of all the numbers written on the board?

The sum of squares of two consecutive integers can be a square, as in $3^2+4^2 =5^2$. Prove that the sum of squares of $m$ consecutive integers cannot be a square for $m = 3$ or $6$ and find an example of $11$ consecutive integers the sum of whose squares is a square.

Find all positive integers $n$ for which there exist positive integers $a, b,$ and $c$ that satisfy the following three conditions: $\bullet$ $a+b+c=n$ $\bullet$ $a$ is a divisor of $b$ and $b$ is a divisor of $c$ $\bullet$ $a < b < c$

Let $p_1<p_2<p_3<p_4$ and $q_1<q_2<q_3<q_4$ be two sets of prime numbers, such that $p_4 - p_1 = 8$ and $q_4 - q_1= 8$. Suppose $p_1 > 5$ and $q_1>5$. Prove that $30$ divides $p_1 - q_1$.

For any $ a\in\mathbb{Z}_{\ge 0} $ make the notation $ a\mathbb{Z}_{\ge 0} =\{ an| n\in\mathbb{Z}_{\ge 0} \} . $ Prove that the following relations are equivalent: $ \text{(1)} a\mathbb{Z}_{\ge 0} \setminus b\mathbb{Z}_{\ge 0}\subset c\mathbb{Z}_{\ge 0} \setminus d\mathbb{Z}_{\ge 0} $ $ \text{(2)} b|a\text{ or } (c|a\text{ and } \text{lcm} (a,b) |\text{lcm} (a,d)) $ [i]Marin Tolosi[/i] and [i]Cosmin Nitu[/i]

A positive integer is a good number, if its base $10$ representation can be split into at least $5$ sections, each section with a non-zero digit, and after interpreting each section as a positive integer (omitting leading zero digits), they can be split into two groups, such that each group can be reordered to form a geometric sequence (if a group has $1$ or $2$ numbers, it is also a geometric sequence), for example $20240327$ is a good number, since after splitting it as $2|02|403|2|7$, $2|02|2$ and $403|7$ form two groups of geometric sequences. If $a>1$, $m>2$, $p=1+a+a^2+\dots+a^m$ is a prime, prove that $\frac{10^{p-1}-1}{p}$ is a good number.

Find all natural numbers, which cannot be expressed in the form $\frac{a}{b}+\frac{a+1}{b+1}$ where $a,b\in \mathbb{N}$.

Determine all positive integers that cannot be written as $\dfrac{a}{b}+\dfrac{a+1}{b+1}$, where $a$ and $b$ are positive integers.

Julián writes five positive integers, not necessarily different, such that their product is equal to their sum. What could be the numbers that Julian writes?

An ordered pair of integers $(m,n)$ with $1<m<n$ is said to be a [i]Benelux couple[/i] if the following two conditions hold: $m$ has the same prime divisors as $n$, and $m+1$ has the same prime divisors as $n+1$. (a) Find three Benelux couples $(m,n)$ with $m\leqslant 14$. (b) Prove that there are infinitely many Benelux couples

A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]

Determine all integers $k$ such that there exists infinitely many positive integers $n$ [b]not[/b] satisfying \[n+k |\binom{2n}{n}\]

Define $f: \mathbb{N} \rightarrow \mathbb{N}$ by $$f(n) = \sum \frac{(1+\sum_{i=1}^{n} t_i)!}{(1+t_1) \cdot \prod_{i=1}^{n} (t_i!) }$$ where the sum runs through all $n$-tuples such that $\sum_{j=1}^{n}j \cdot t_j=n$ and $t_j \ge 0$ for all $1 \le j \le n$. Given a prime $p$ greater than $3$, prove that $$\sum_{1 \le i < j <k \le p-1 } \frac{f(i)}{i \cdot j \cdot k} \equiv \sum_{1 \le i < j <k \le p-1 } \frac{2^i}{i \cdot j \cdot k} \pmod{p}.$$

You have a set of five weights, together with a balance that allows you to compare the weight of two things. The weights are known to be $10$, $20$,$30$,$40$ and $50$ grams, but are otherwise identical except for their labels. The $10$ and $50$ gram weights are clearly labelled, but the labels have been erased on the remaining weights. Using the balance exactly once, is it possible to determine what one of the three unlabelled weights is? If so, explain how, and if not, explain why not.

The following sequence of positive integers $a_1, a_2, ..., a_{400}$ satisfies the relationship $a_{n+1} = \tau (a_n) + \tau (n)$ for all $1 \le n \le 399$, where $\tau (k) $ is the number of positive integer divisors that $k$ has. Prove that in the sequence there are no more than $210$ prime numbers.

Prove that the integer $1^1 + 3^3 + 5^5 + .. + (2^n - 1)^{2^n-1}$ is a multiple of $2^n$ but not a multiple of $2^{n+1}$.

p1. Among the numbers $\frac15$ and $\frac14$ there are infinitely many fractional numbers. Find $999$ decimal numbers between $\frac15$ and $\frac14$ so that the difference between the next fractional number with the previous fraction constant. (i.e. If $x_1, x_2, x_3, x_4,..., x_{999}$ is a fraction that meant, then $x_2 - x_1= x_3 - x_3= ...= x_n - x_{n-1}=...=x_{999}-x_{998}$) p2. The pattern in the image below is: "Next image obtained by adding an image of a black equilateral triangle connecting midpoints of the sides of each white triangle that is left in the previous image." The pattern is continuous to infinity. [img]https://cdn.artofproblemsolving.com/attachments/e/f/81a6b4d20607c7508169c00391541248b8f31e.png[/img] It is known that the area of ​​the triangle in Figure $ 1$ is $ 1$ unit area. Find the total area of ​​the area formed by the black triangles in figure $5$. Also find the total area of the area formed by the black triangles in the $20$th figure. p3. For each pair of natural numbers $a$ and $b$, we define $a*b = ab + a - b$. The natural number $x$ is said to be the [i]constituent [/i] of the natural number $n$ if there is a natural number $y$ that satisfies $x*y = n$. For example, $2$ is a constituent of $6$ because there is a natural number 4 so that $2*4 = 2\cdot 4 + 2 - 4 = 8 + 2 - 4 = 6$. Find all constituent of $2005$. p4. Three people want to eat at a restaurant. To find who pays them to make a game. Each tossing one coin at a time. If the result is all heads or all tails, then they toss again. If not, then "odd person" (i.e. the person whose coin appears different from the two other's coins) who pay. Determine the number of all possible outcomes, if the game ends in tossing: a. First. b. Second. c. Third. d. Tenth. p5. Given the equation $x^2 + 3y^2 = n$, where $x$ and $y$ are integers. If $n < 20$ what number is $n$, and which is the respective pair $(x,y)$ ? Show that it is impossible to solve $x^2 + 3y^2 = 8$ in integers.

250 numbers are chosen among positive integers not exceeding 501. Prove that for every integer $ t$ there are four chosen numbers $ a_1$, $ a_2$, $ a_3$, $ a_4$, such that $ a_1 \plus{} a_2 \plus{} a_3 \plus{} a_4 \minus{} t$ is divisible by 23. [i]Author: K. Kokhas[/i]

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that $1+L_{2^{j}}\equiv 0 \pmod{2^{j+1}}$ for $j \geq 0$.

Let $n$ be a positive integer. Prove that the number $2^n + 1$ has no prime divisor of the form $8 \cdot k - 1$, where $k$ is a positive integer.

We call natural number $m$ [b]ziba[/b], iff every natural number $n$ with the condition $1\le n\le m$ can be shown as sum of [some of] positive and [u]distinct[/u] divisors of $m$. Prove that infinitely ziba numbers in the form of $(k\in\mathbb{N})k^2+k+2022$ exist.

$a)$ Let $n$ a positive integer. Prove that $gcd(n, \lfloor n\sqrt{2} \rfloor)<\sqrt[4]{8}\sqrt{n}$. $b)$ Prove that there are infinitely many positive integers $n$ such that $gcd(n, \lfloor n\sqrt{2} \rfloor)>\sqrt[4]{7.99}\sqrt{n}$.

Let $n \geq 2$ be an integer. Find the maximal cardinality of a set $M$ of pairs $(j, k)$ of integers, $1 \leq j < k \leq n$, with the following property: If $(j, k) \in M$, then $(k,m) \not \in M$ for any $m.$

It is given $n$ a natural number and a circle with circumference $n$. On the circle, in clockwise direction, numbers $0,1,2,\dots n-1$ are written, in this order and in the same distance to each other. Every number is colored red or blue, and there exists a non-zero number of numbers of each color. It is known that there exists a set $S\subsetneq \{0,1,2,\dots n-1\}, |S|\geq 2$, for wich it holds: if $(x,y), x<y$ is a circle sector whose endpoints are of distinct colors, whose distance $y-x$ is in $S$, then $y$ is in $S$. Prove that there is a divisor $d$ of $n$ different from $1$ and $n$ for wich holds: if $(x,y),x<y$ are different points of distinct colors, such that their distance is divisible by $d$, then both $x,y$ are divisible by $d$.

Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$