For a given integer $n\ge 2$, let $\{a_1,a_2,…,a_m\}$ be the set of positive integers less than $n$ that are relatively prime to $n$. Prove that if every prime that divides $m$ also divides $n$, then $a_1^k+a_2^k + \dots + a_m^k$ is divisible by $m$ for every positive integer $k$. [i]Proposed by Ivan Borsenco[/i]

A set $S$ of positive integers is called magic if for any two distinct members of $S, i$ and $j$, $\frac{i+ j}{GCD(i, j)}$is also a member of $S$. The $GCD$, or greatest common divisor, of two positive integers is the largest integer that divides evenly into both of them; for example, $GCD(36,80) = 4$. Find and describe all finite magic sets.

For a prime $ p$ an a positive integer $ n$, denote by $ \nu_p(n)$ the exponent of $ p$ in the prime factorization of $ n!$. Given a positive integer $ d$ and a finite set $ \{p_1,p_2,\ldots, p_k\}$ of primes, show that there are infinitely many positive integers $ n$ such that $ \nu_{p_i}(n) \equiv 0 \pmod d$, for all $ 1\leq i \leq k$.

Consider the set $E = \{5, 6, 7, 8, 9\}$. For any partition ${A, B}$ of $E$, with both $A$ and $B$ non-empty, consider the number obtained by adding the product of elements of $A$ to the product of elements of $B$. Let $N$ be the largest prime number amonh these numbers. Find the sum of the digits of $N$.

The points $(1,1),(2,3),(4,5)$ and $(999,111)$ are marked in the coordinate system. We continue to mark points in the following way : [list] [*]If points $(a,b)$ are marked then $(b,a)$ and $(a-b,a+b)$ can be marked [*]If points $(a,b)$ and $(c,d)$ are marked then so can be $(ad+bc, 4ac-4bd)$. [/list] Can we, after some finite number of these steps, mark a point belonging to the line $y=2x$.

Find all integers $n$ such that $n^4 + 8n + 11$ is a product of two or more consecutive integers.

Given $m,n \in N$ such that $M>n^{n-1}$ and the numbers $m+1, m+2, ..., m+n$ are composite. Prove that exist distinct primes $p_1,p_2,...,p_n$ such that $M+k$ is divisible by $p_k$ for any $k=1,2,...,n$. Tuymaada Olympiad 2004, C.A.Grimm. USA

Do there exist distinct non-zero digits $a, b$ and $c$ such that the two-digit number $\overline{ab}$ is divisible by $c$, the number $\overline{bc}$ is divisible by $a$ and $\overline{ca}$, is divisible by $b$?

A positive integer $N$ has base-eleven representation $\underline{a}\,\underline{b}\,\underline{c}$ and base-eight representation $\underline{1}\,\underline{b}\,\underline{c}\,\underline{a}$, where $a$, $b$, and $c$ represent (not necessarily distinct) digits. Find the least such $N$ expressed in base ten.

We call a positive integer [i]alternating[/i] if every two consecutive digits in its decimal representation are of different parity. Find all positive integers $n$ such that $n$ has a multiple which is alternating.

[b]p1.[/b] Consider a triangular grid: nodes of the grid are painted black and white. At a single step you are allowed to change colors of all nodes situated on any straight line (with the slope $0^o$ ,$60^o$, or $120^o$ ) going through the nodes of the grid. Can you transform the combination in the left picture into the one in the right picture in a finite number of steps? [img]https://cdn.artofproblemsolving.com/attachments/3/a/957b199149269ce1d0f66b91a1ac0737cf3f89.png[/img] [b]p2.[/b] Find $x$ satisfying $\sqrt{x\sqrt{x \sqrt{x ...}}} = \sqrt{2022}$ where it is an infinite expression on the left side. [b]p3.[/b] $179$ glasses are placed upside down on a table. You are allowed to do the following moves. An integer number $k$ is fixed. In one move you are allowed to turn any $k$ glasses . (a) Is it possible in a finite number of moves to turn all $179$ glasses into “bottom-down” positions if $k=3$? (b) Is it possible to do it if $k=4$? [b]p4.[/b] An interval of length $1$ is drawn on a paper. Using a compass and a simple ruler construct an interval of length $\sqrt{93}$. [b]p5.[/b] Show that $5^{2n+1} + 3^{n+2} 2^{n-1} $ is divisible by $19$ for any positive integer $n$. [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=1-z \\ \dfrac{yz}{y+z}=2-x \\ \dfrac{xz}{x+z}=2-y \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given an integer $a>1$. Let $p_1 < p_2 <...< p_k$ be all prime divisors of $a$. For each positive integer $n$ we define: $C_0(n) = a^{2n}, C_1(n) =\frac{a^{2n}}{p^2_1}, .... , C_k(n) =\frac{a^{2_n}}{p^2_k}$ $A = a^2 + 1$ $T(n) = A^{C_0(n)} - 1$ $M(n) = LCM(a^{2n+2}, A^{C_1(n)} - 1, ..., A^{C_k(n)} - 1)$ $A_n =\frac{T(n)}{M(n)}$ Prove that the sequence $A_1, A_2, ... $ satisfies the properties: (i) Every number in the sequence is an integer greater than $1$ and has only prime divisors of the form $am + 1$. (ii) Any two different numbers in the sequence are coprime.

Determine all triples $(a, b, c)$ of positive integers such that $$a! + b! = 2^{c!}.$$ [i](Walther Janous)[/i]

Find a positive integer $x$ such that the sum of the digits of $x$ is greater than $2011$ times the sum of the digits of the number $3x$ ($3$ times $x$).

[b]p1.[/b] There are $2024$ apples in a very large basket. First, Julie takes away half of the apples in the basket; then, Diane takes away $202$ apples from the remaining bunch. How many apples remain in the basket? [b]p2.[/b] The set of all permutations (different arrangements) of the letters in ”ABMC” are listed in alphabetical order. The first item on the list is numbered $1$, the second item is numbered $2$, and in general, the kth item on the list is numbered $k$. What number is given to ”ABMC”? [b]p3.[/b] Daniel has a water bottle that is three-quarters full. After drinking $3$ ounces of water, the water bottle is three-fifths full. The density of water is $1$ gram per milliliter, and there are around $28$ grams per ounce. How many milliliters of water could the bottle fit at full capacity? [b]p4.[/b] How many ways can four distinct $2$-by-$1$ rectangles fit on a $2$-by-$4$ board such that each rectangle is fully on the board? [b]p5.[/b] Iris and Ivy start reading a $240$ page textbook with $120$ left-hand pages and $120$ right-hand pages. Iris takes $4$ minutes to read each page, while Ivy takes $5$ minutes to read a left-hand page and $3$ minutes to read a right-hand page. Iris and Ivy move onto the next page only when both sisters have completed reading. If a sister finishes reading a page first, the other sister will start reading three times as fast until she completes the page. How many minutes after they start reading will both sisters finish the textbook? [b]p6.[/b] Let $\vartriangle ABC$ be an equilateral triangle with side length $24$. Then, let $M$ be the midpoint of $BC$. Define $P$ to be the set of all points $P$ such that $2PM = BC$. The minimum value of $AP$ can be expressed as $\sqrt{a}- b$, where $a$ and $b$ are positive integers. Find $a + b$. [b]p7.[/b] Jonathan has $10$ songs in his playlist: $4$ rap songs and $6$ pop songs. He will select three unique songs to listen to while he studies. Let $p$ be the probability that at least two songs are rap, and let $q$ be the probability that none of them are rap. Find $\frac{p}{q}$ . [b]p8.[/b] A number $K$ is called $6,8$-similar if $K$ written in base $6$ and $K$ written in base $8$ have the same number of digits. Find the number of $6,8$-similar values between $1$ and $1000$, inclusive. [b]p9.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD^2$. [b]p10.[/b] Bob, Eric, and Raymond are playing a game. Each player rolls a fair $6$-sided die, and whoever has the highest roll wins. If players are tied for the highest roll, the ones that are tied reroll until one wins. At the start, Bob rolls a $4$. The probability that Eric wins the game can be expressed as $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p11.[/b] Define the following infinite sequence $s$: $$s = \left\{\frac92,\frac{99}{2^2},\frac{999}{2^3} , ... , \overbrace{\frac{999...999}{2^k}}^{k\,\,nines}, ...\right\}$$ The sum of the first $2024$ terms in $s$, denoted $S$, can be expressed as $$S =\frac{5^a - b}{4}+\frac{1}{2^c},$$ where $a, b$, and $c$ are positive integers. Find $a + b + c$. [b]p12.[/b] Andy is adding numbers in base $5$. However, he accidentally forgets to write the units digit of each number. If he writes all the consecutive integers starting at $0$ and ending at $50$ (base $10$) and adds them together, what is the difference between Andy’s sum and the correct sum? (Express your answer in base-$10$.) [b]p13.[/b] Let $n$ be the positive real number such that the system of equations $$y =\frac{1}{\sqrt{2024 - x^2}}$$ $$y =\sqrt{x^2 - n}$$ has exactly two real solutions for $(x, y)$: $(a, b)$ and $(-a, b)$. Then, $|a|$ can be expressed as $j\sqrt{k}$, where $j$ and $k$ are integers such that $k$ is not divisible by any perfect square other than $1$. Find $j · k$. [b]p14.[/b] Nakio is playing a game with three fair $4$-sided dice. But being the cheater he is, he has secretly replaced one of the three die with his own $4$-sided die, such that there is a $1/2$ chance of rolling a $4$, and a $1/6$ chance to roll each number from $1$ to $3$. To play, a random die is chosen with equal probability and rolled. If Nakio guesses the number that is on the die, he wins. Unfortunately for him, Nakio’s friends have an anti-cheating mechanism in place: when the die is picked, they will roll it three times. If each roll lands on the same number, that die is thrown out and one of the two unused dice is chosen instead with equal probability. If Nakio always guesses $4$, the probability that he wins the game can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime. Find $m + n$. [b]p15.[/b] A particle starts in the center of a $2$m-by-$2$m square. It moves in a random direction such that the angle between its direction and a side of the square is a multiple of $30^o$. It travels in that direction at $1$ m/s, bouncing off of the walls of the square. After a minute, the position of the particle is recorded. The expected distance from this point to the start point can be written as $$\frac{1}{a}\left(b - c\sqrt{d}\right),$$ where $a$ and $b$ are relatively prime, and d is not divisible by any perfect square. Find $a + b + c + d$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $a$ and $b$ are positive integers, prove that $11a+2b$ is a multiple of $19$ if and only if so is $18a+5b$ .

The sequence $(a_n)_{n \ge 1}^\infty$ is given by: $a_1=2$ and $a_{n+1}=a_n^2+a_n$ for all $n \ge 1$. For an integer $m \ge 2$, $L(m)$ denotes the greatest prime divisor of $m$. Prove that there exists some $k$, for which $L(a_k) > 1000^{1000}$. [i]Proposed by Nikola Velov[/i]

Let $p$ be a prime such that $16p+1$ is a perfect cube. A possible choice for $p$ is [list=1] [*] 283 [*] 307 [*] 593 [*] 691 [/list]

In a school class with $ 3n$ children, any two children make a common present to exactly one other child. Prove that for all odd $ n$ it is possible that the following holds: For any three children $ A$, $ B$ and $ C$ in the class, if $ A$ and $ B$ make a present to $ C$ then $ A$ and $ C$ make a present to $ B$.

[b](a)[/b] Does there exist a positive integer $n$ such that the decimal representation of $n!$ ends with the string $2004$, followed by a number of digits from the set $\left\{0;\;4\right\}$ ? [b](b)[/b] Does there exist a positive integer $n$ such that the decimal representation of $n!$ starts with the string $2004$ ?

Prove that $n^4 + 4^{n}$ is composite for all values of $n$ greater than $1$.

Show that the only solutions of te equation \[ p^{k} + 1 = q^{m} \], in positive integers $k,q,m > 1$ and prime $p$ are (i) $(p,k,q,m) = (2,3,3,2)$ (ii) $k=1 , q=2,$and $p$ is a prime of the form $2^{m} -1$, $m > 1 \in \mathbb{N}$

Prove that if $x, y$ and $n$ are positive integers such that $$x^{2024} + y^{2024} = 2^n,$$ then $x=y$.

Let $n$ be a positive integer such that the sum of all its positive divisors (inclusive of $n$) equals to $2n + 1$. Prove that $n$ is an odd perfect square. related: https://artofproblemsolving.com/community/c6h515011 https://artofproblemsolving.com/community/c6h108341 (Putnam 1976) https://artofproblemsolving.com/community/c6h368488 https://artofproblemsolving.com/community/c6h445330 https://artofproblemsolving.com/community/c6h378928

For which non-negative integers $n$ is \[K=5^{2n+3} + 3^{n+3} \cdot 2^n\] prime?