Let $A_1, A_2, ... , A_k$ be the subsets of $\left\{1,2,3,...,n\right\}$ such that for all $1\leq i,j\leq k$:$A_i\cap A_j \neq \varnothing$. Prove that there are $n$ distinct positive integers $x_1,x_2,...,x_n$ such that for each $1\leq j\leq k$: $$lcm_{i \in A_j}\left\{x_i\right\}>lcm_{i \notin A_j}\left\{x_i\right\}$$ [i]Proposed by Morteza Saghafian, Mahyar Sefidgaran[/i]

A positive integer is [i]happy[/i] if: 1. All its digits are different and not $0$, 2. One of its digits is equal to the sum of the other digits. For example, 253 is a [i]happy[/i] number. How many [i]happy[/i] numbers are there?

Let $a$ and $n$ be positive integers such that the greatest common divisor of $a$ and $n!$ is $1$. Prove that $n!$ divides $a^{n!}-1$.

A square $ 600 \times 600$ divided into figures of $4$ cells of the forms in the figure: In the figures of the first two types in shaded cells The number $ 2 ^ k $ is written, where $ k $ is the number of the column in which this cell. Prove that the sum of all the numbers written is divisible by $9$.

Let $P$ be the set of all primes, and let $M$ be a non-empty subset of $P$. Suppose that for any non-empty subset ${p_1,p_2,...,p_k}$ of $M$, all prime factors of $p_1p_2...p_k+1$ are also in $M$. Prove that $M=P$. [i]Proposed by Alex Zhai[/i]

Let $N$ be a natural number which can be expressed in the form $a^{2}+b^{2}+c^{2}$, where $a,b,c$ are integers divisible by 3. Prove that $N$ can be expressed in the form $x^{2}+y^{2}+z^{2}$, where $x,y,z$ are integers and any of them are divisible by 3.

The units-digit of the square of an integer is 9 and the tens-digit of this square is 0. Prove that the hundreds-digit is even.

Ana and Banana are playing a game. Initially, Ana secretly picks a number $1\leq A\leq 10^6$. In each subsequent turn of the game, Banana may pick a positive integer $B$, and Ana will reveal to him the most common digit in the product $A\cdot B$ (written in decimal notation). In the case when at least two digits are tied for being the most common, Ana will reveal all of them to Banana. For example, if $A\cdot B=2022$, Ana will tell Banana that the digit $2$ is the most common, while if $A\cdot B=5783783$, Ana will reveal that $3, 7$ and $8$ are the most common. Banana's goal is to determine with certainty the number $A$ after some number of turns. Does he have a winning strategy?

Find all natural numbers that have a multiple consisting only of the digit 9.

Let two positive integers $x, y$ satisfy the condition $44 /( x^2 + y^2)$. Determine the smallest value of $T = x^3 + y^3$.

Determine all pairs of integers $(a, b)$ that solve the equation $a^3 + b^3 + 3ab = 1$.

a. Does there exist 4 distinct positive integers such that the sum of any 3 of them is prime? b. Does there exist 5 distinct positive integers such that the sum of any 3 of them is prime?

A positive integer number is written in red on each side of a square. The product of the two red numbers on the adjacent sides is written in green for each corner point. The sum of the green numbers is $40$. Which values ​​are possible for the sum of the red numbers? (G. Kirchner, University of Innsbruck)

Determine all quadruples $ (a,b,c,d)$ of nonnegative integers satisfying: $ a^2\plus{}b^2\plus{}c^2\plus{}d^2\equal{}a^2 b^2 c^2$.

Albrecht is travelling in his car on the motorway at a constant speed. The journey is very long so Marvin who is sitting next to Albrecht gets bored and decides to calculate the speed of the car. He was a bit careless but he noted that at noon they passed milestone $XY$ (where $X$ and $Y$ are digits), at $12:42$ milestone $YX$ and at $1$pm they arrived at milestone $X0Y$. What did Marvin deduce, what is the speed of the car?

We call a permutation $(a_1, a_2,\cdots , a_n)$ of the set $\{ 1,2,\cdots, n\}$ "good" if for any three natural numbers $i <j <k$, $n\nmid a_i+a_k-2a_j$ find all natural numbers $n\ge 3$ such that there exist a "good" permutation of a set $\{1,2,\cdots, n\}$.

$n\ge 2 $ is an integer.Prove that the number of natural numbers $m$ so that $0 \le m \le n^2-1,x^n+y^n \equiv m (mod n^2)$ has no solutions is at least $\binom{n}{2}$

Let $a$ be a natural number, $a>3$. Prove there is an infinity of numbers n, for which $a+n|a^{n}+1$

[b]p1.[/b] Solve the equation $\log_x (x + 2) = 2$. [b]p2.[/b] Solve the inequality: $0.5^{|x|} > 0.5^{x^2}$. [b]p3.[/b] The integers from 1 to 2015 are written on the blackboard. Two randomly chosen numbers are erased and replaced by their difference giving a sequence with one less number. This process is repeated until there is only one number remaining. Is the remaining number even or odd? Justify your answer. [b]p4.[/b] Four circles are constructed with the sides of a convex quadrilateral as the diameters. Does there exist a point inside the quadrilateral that is not inside the circles? Justify your answer. [b]p5.[/b] Prove that for any finite sequence of digits there exists an integer the square of which begins with that sequence. [b]p6.[/b] The distance from the point $P$ to two vertices $A$ and $B$ of an equilateral triangle are $|P A| = 2$ and $|P B| = 3$. Find the greatest possible value of $|P C|$. PS. You should use hide for answers.

In a certain game, Auntie Hall has four boxes $B_1$, $B_2$, $B_3$, $B_4$, exactly one of which contains a valuable gemstone; the other three contain cups of yogurt. You are told the probability the gemstone lies in box $B_n$ is $\frac{n}{10}$ for $n=1,2,3,4$. Initially you may select any of the four boxes; Auntie Hall then opens one of the other three boxes at random (which may contain the gemstone) and reveals its contents. Afterwards, you may change your selection to any of the four boxes, and you win if and only if your final selection contains the gemstone. Let the probability of winning assuming optimal play be $\tfrac mn$, where $m$ and $n$ are relatively prime integers. Compute $100m+n$. [i]Proposed by Evan Chen[/i]

Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied: [list=1] [*] Each number in the table is congruent to $1$ modulo $n$. [*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$. [/list] Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.

Find the remainder when $11^{2018}$ is divided by $100$.

[b]p1.[/b] Calculate $A \cdot B +M \cdot C$, where $A = 1$, $B = 2$, $C = 3$, $M = 13$. [b]p2.[/b] What is the remainder of $\frac{2022\cdot2023}{10}$ ? [b]p3.[/b] Daniel and Bryan are rolling fair $7$-sided dice. If the probability that the sum of the numbers that Daniel and Bryan roll is greater than $11$ can be represented as the fraction $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers, what is $a + b$? [b]p4.[/b] Billy can swim the breaststroke at $25$ meters per minute, the butterfly at $30$ meters per minute, and the front crawl at $40$ meters per minute. One day, he swam without stopping or slowing down, swimming $1130$ meters. If he swam the butterfly for twice as long as the breaststroke, plus one additional minute, and the front crawl for three times as long as the butterfly, minus eight minutes, for how many minutes did he swim? [b]p5.[/b] Elon Musk is walking around the circumference of Mars trying to find aliens. If the radius of Mars is $3396.2$ km and Elon Musk is $73$ inches tall, the difference in distance traveled between the top of his head and the bottom of his feet in inches can be expressed as $a\pi$ for an integer $a$. Find $a$. ($1$ yard is exactly $0.9144$ meters). [b]p6.[/b] Lukas is picking balls out of his five baskets labeled $1$,$2$,$3$,$4$,$5$. Each basket has $27$ balls, each labeled with the number of its respective basket. What is the least number of times Lukas must take one ball out of a random basket to guarantee that he has chosen at least $5$ balls labeled ”$1$”? If there are no balls in a chosen basket, Lukas will choose another random basket. [b]p7.[/b] Given $35_a = 42_b$, where positive integers $a$, $b$ are bases, find the minimum possible value of the sum $a + b$ in base $10$. [b]p8.[/b] Jason is playing golf. If he misses a shot, he has a $50$ percent chance of slamming his club into the ground. If a club is slammed into the ground, there is an $80$ percent chance that it breaks. Jason has a $40$ percent chance of hitting each shot. Given Jason must successfully hit five shots to win a prize, what is the expected number of clubs Jason will break before he wins a prize? [b]p9.[/b] Circle $O$ with radius $1$ is rolling around the inside of a rectangle with side lengths $5$ and $6$. Given the total area swept out by the circle can be represented as $a + b\pi$ for positive integers $a$, $b$ find $a + b$. [b]p10.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD$. [b]p11.[/b] Raymond is eating huge burgers. He has been trained in the art of burger consumption, so he can eat one every minute. There are $100$ burgers to start with. However, at the end of every $20$ minutes, one of Raymond’s friends comes over and starts making burgers. Raymond starts with $1$ friend. If each of his friends makes $1$ burger every $20$ minutes, after how long in minutes will there be $0$ burgers left for the first time? [b]p12.[/b] Find the number of pairs of positive integers $(a, b)$ and $b\le a \le 2022$ such that $a\cdot lcm(a, b) = b \cdot gcd(a, b)^2$. [b]p13.[/b] Triangle $ABC$ has sides $AB = 6$, $BC = 10$, and $CA = 14$. If a point $D$ is placed on the opposite side of $AC$ from $B$ such that $\vartriangle ADC$ is equilateral, find the length of $BD$. [b]p14.[/b] If the product of all real solutions to the equation $(x-1)(x-2)(x-4)(x-5)(x-7)(x-8) = -x^2+9x-64$ can be written as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, b, d) = 1$ and $c$ is squarefree, compute $a + b + c + d$. [b]p15.[/b] Joe has a calculator with the keys $1, 2, 3, 4, 5, 6, 7, 8, 9,+,-$. However, Joe is blind. If he presses $4$ keys at random, and the expected value of the result can be written as $\frac{x}{11^4}$ , compute the last $3$ digits of $x$ when $x$ divided by $1000$. (If there are consecutive signs, they are interpreted as the sign obtained when multiplying the two signs values together, e.g $3$,$+$,$-$,$-$, $2$ would return $3 + (-(-(2))) = 3 + 2 = 5$. Also, if a sign is pressed last, it is ignored.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ a_0$ be a natural number. The sequence $ (a_n)$ is defined by $ a_{n\plus{}1}\equal{}\frac{a_n}{5}$ if $ a_n$ is divisible by $ 5$ and $ a_{n\plus{}1}\equal{}[a_n \sqrt{5}]$ otherwise . Show that the sequence $ a_n$ is increasing starting from some term.

Let $n$ be a positive integer. Let $S$ be a set of $n$ positive integers such that the greatest common divisors of all nonempty sets of $S$ are distinct. Determine the smallest possible number of distinct prime divisors of the product of the elements of $S$.